Let us construct the first Binary Tree 1 / \ 2 3 / \ \ 4 5 6
root1 = newNode ( 1 ) ; NEW_LINE root1 . left = newNode ( 2 ) ; NEW_LINE root1 . right = newNode ( 3 ) ; NEW_LINE root1 . left . left = newNode ( 4 ) ; NEW_LINE root1 . left . right = newNode ( 5 ) ; NEW_LINE root1 . right . right = newNode ( 6 ) ; NEW_LINE