Consider the following level - order sorted tree 5 / \ 8 10 / \ / \ 13 23 25 30 / \ / 32 40 50
Node * root = new Node ( 5 ) ; root -> left = new Node ( 8 ) ; root -> right = new Node ( 10 ) ; root -> left -> left = new Node ( 13 ) ; root -> left -> right = new Node ( 23 ) ; root -> right -> left = new Node ( 25 ) ; root -> right -> right = new Node ( 30 ) ; root -> left -> left -> left = new Node ( 32 ) ; root -> left -> left -> right = new Node ( 40 ) ; root -> left -> right -> left = new Node ( 50 ) ;