The while statement is an indefinite loop.

A binary tree:

a. Has a root node. b. Each node has no more than two branches. c. Uses stacks to process the nodes. d. Uses two extra fields for the pointers to the branches. e. All of the above.

The table total row adapts to any changes in the table size.?

Answer the following statement true (T) or false (F)