What number do you get after printing the values, given in the above tree, using In-order Traversing Technique ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Doing it without a program is really fun. Remember it is binary tree and not binary search tree so no sorted order while doing inorder traversal will get printed. Nice problem...!!! :-) 2 − 7 − 5 − 6 − 1 1 − 2 − 5 − 4 − 9