Suppose that you number the nodes of a complete binary tree in the order in which a level-order traversal would visit them. The tree’s root would then be node 1. Figure 24-25 shows an example of such...

Suppose that you number the nodes of a complete binary tree in the order in which a level-order traversal would visit them. The tree’s root would then be node 1. Figure 24-25 shows an example of such a tree. What number, in terms of i, is node i’s

Figure 24-25

A complete binary tree with its nodes numbered in level order (Exercise 16)

 a. Sibling, if any

b. Left child, if any

c. Right child, if any

 d. Parent, if any