Consider the following level order sorted tree 5 / \ 8 10 / \ / \ 13 23 25 30 / \ / 32 40 50
root = Node ( 5 ) NEW_LINE root . left = Node ( 8 ) NEW_LINE root . right = Node ( 10 ) NEW_LINE root . left . left = Node ( 13 ) NEW_LINE root . left . right = Node ( 23 ) NEW_LINE root . right . left = Node ( 25 ) NEW_LINE root . right . right = Node ( 30 ) NEW_LINE root . left . left . left = Node ( 32 ) NEW_LINE root . left . left . right = Node ( 40 ) NEW_LINE root . left . right . left = Node ( 50 ) NEW_LINE