A Binary Tree 3 / \ 2 5 / \ 4 6
Node * root = new Node ( 3 ) ; root -> left = new Node ( 2 ) ; root -> right = new Node ( 5 ) ; root -> left -> left = new Node ( 4 ) ; root -> right -> right = new Node ( 7 ) ;