You are viewing a single comment's thread. Return to all comments →
Your Binary tree (shown) is not correct,
Binary tree algo : if new value is small to previous value goes to left or else goes to rigth of previous value
Put your values as input in his code you will see correct output which is 1,2,3,4,5,6
Seems like cookies are disabled on this browser, please enable them to open this website
Tree: Inorder Traversal
You are viewing a single comment's thread. Return to all comments →
Your Binary tree (shown) is not correct,
Binary tree algo : if new value is small to previous value goes to left or else goes to rigth of previous value
Put your values as input in his code you will see correct output which is 1,2,3,4,5,6