Answer the following statements true (T) or false (F)
1. There exists a binary tree with a hundred nodes, but only one leaf.
2. The pre order method of traversing a binary tree involves processing the root node's data, traversing the left sub tree, and then traversing the right sub tree.
3. In a binary search tree where all the stored values are different, the node holding the largest value cannot have two children.
4. The smallest number of levels that a binary tree with three nodes can have is two.
5. In a binary search tree, all nodes to the right of a node hold values greater than the node's value.
1. TRUE
2. TRUE
3. TRUE
4. TRUE
5. TRUE
You might also like to view...
What data types can the selector expression in the switch statement evaluate to?
What will be an ideal response?
(The Circle class) Implement the relational operators < in the Circle class in Listing 9.5 to order the Circle objects according to their radii.
``` class Circle { public: Circle(); Circle(double); double getArea(); double getRadius(); void setRadius(double); private: double radius; }; ```
After you add a Web reference, a Web References folder containing the name of the Web service connection is displayed in the ____.
A. UDDI directory B. Solution Explorer C. Web Service Wizard D. Reference Wizard
?If modules areloosely coupled, one module is linked to internal logic contained in another module.
Answer the following statement true (T) or false (F)