Reference no: EM133460685

Chapter 7

True/False Questions

1. Every node in a tree has at most two children.

2. The depth of a tree node is the number of nodes between it and the root of the tree.

3. A tree has exactly one root node.

4. A complete binary tree is necessarily a full binary tree.

5. A full binary tree is necessarily a complete binary tree.

6. An in-order traversal of any binary tree produces the items in sorted order.

7. A postorder traversal of an expression tree yields the postfix (reverse Polish) form of an expression.

8. The worst-case search time for a binary search tree is Θ(n).

9. Every subtree of a binary search tree is also a binary search tree.

10. Since binary trees are non-linear, they cannot be easily implemented using an array.