Implementation of Trees

Problem : Use our array implementation to draw the tree that corresponds to the following array:

Solution for Problem 1 >>

Figure %: Solution 1

The process for determining what the tree looks like is to assume a perfect tree corresponding to the number of cells in the array and then to fill in successive rows in the tree (nodes of the same depth). If a cell is EMPTY, it means that the parent node has a null pointer to it.

Close

Problem : What is problematic about the following tree?

#define EMPTY	0

int array[] = {0, 1, EMPTY, 1, 4, 0, EMPTY};

Problem : If you know that a node corresponds to index i the array, what would be the index of its parent?