1) Given a binary tree, compute its "maxDepth" -- the number of edges (note that NOT nodes) along the longest path from the root node down to the farthest leaf node. The maxDepth of the empty tree and a single root node is 0.

Syntax: int maxDepth(struct * node) or int MaxDepth(Node node)

2) Given a binary search tree and a value k, implement a function to find the node in the binary search tree whose value is closest to k.

Syntax: int lookup(struct * node) or int lookup(Node node)