Assume that v is an array-based tree with 70 members.
(a). Is v a leaf node?
(b). What is the index of the first leaf node?
(c). What is the parent of v?
(d). What are the children of v?
(e). Does any item have exactly one child?
(f). What is the depth of the tree?
(g). How many leaf nodes does the tree have?
An array-based tree with 70 members has the following structure.
level 1: v
level 2: v, v
level 3: v, v, v, v
level 4: v, v, v, v, v, v, v, ...
Array-based tree, heaps, binary files and bit sets are examined.