previous | index | next

Depth of Binary Tree Nodes

The height of the tree is 4.

Exercise 8.8: write a predicate to determine if the root of a tree is a leaf.

Exercise 8.9: write a procedure to return the height of a tree (uses Ex. 8.8)


previous | index | next