These are the functions supported on a tree:

 1. add(parentNode, node): Add node as a child to parentNode.
 2. findRandomLeaf(): Print a random leaf present in the tree.

Can we do these functions in less than O(N) complexity?