Answer the following statements true (T) or false (F)
1. A binary tree cannot be empty.
2. A tree whose height is h has its root at level h.
3. An inorder traversal visits a node before it traverses either of the node’s subtrees.
4. A complete binary tree with n nodes has a height of log2(n + 1
1. False
2. False
3. False
4. True
You might also like to view...
The principal disadvantage of the _________ approach is that the transfer of control from one thread to another within the same process requires a mode switch to the kernel.
A) ?KLT ? B) ?LWP ? C) ?VAX ? D) ?ULT
OpenOffice Writer is associated with the ____________________ file extension.
Fill in the blank(s) with the appropriate word(s).
Redefine the Task Bag interface from Exercise 8.1 in IDL so that it makes use of a struct to represent a Pair, which consists of a Key and a Value. Note that there is no need to use a typedef to define a struct.
What will be an ideal response?
When you use a ____ within a computer program, you can write one set of instructions that operates on multiple, separate sets of data.
A. counter B. variable C. loop D. sentinel