I've got an exercise where I have a set of numbers for which I have to draw the corresponding binary tree.
However I don't know how to draw the binary tree for them. Is there a specific order that they're supposed to go in?
I know that in binary search trees, you have to put all the numbers less than the root in the left sub-tree and all the numbers greater than the root in the right sub-tree, but I don't know how it works in a regular old binary tree.
Can anyone help me?


LinkBack URL
About LinkBacks




Reply With Quote



Bookmarks
Algorithms and Data Structures
Java tutorials
Algorithms Forum