Traverse that expression tree in pre-order , writing the equivalent prefix expression. For the convention followed by Carrano, it is the number of nodes in the longest path down to a leaf. Thus we define the NULL link as a node of height 0 and use the above recursive determination. For the convention followed by Carrano, it is the number of nodes up to the root of the tree, so that the root is defined to be at depth one . Write the recursive C function to determine the height of a node within a binary tree.
Linkage is as specified above.