:
There are a few ways to represent a tree T with n nodes.
One particularly flexible way is in terms of three arrays. For :
: The key for node i.
: The index of the parent of node i (0 for root).
: The index of the left child of node i (0 if there is none).
: The index of the right child of node i (0 if there is none).
How can we test if node i is a leaf?
