Finding smallest largest values
In Binary Search Tree, we can find maximum by traversing right pointers until we reach rightmost node. But in Binary Tree, we must visit every node to figure out maximum. So the idea is to traverse the given tree and for every node return maximum of 3 values. 1) Node’s data. 2) Maximum in node’s left subtree. 3) Maximum in node’s right subtree.
