data structures - In-order tree traversal -


I have the following text from an academic curriculum, I had some time before in-order traversal (they also call it pankaking)

Start from the left side of the tree outside the tree, and go around the tree, go to the right and end of the root. To stay close to the tree as possible, but do not cross the tree. (Think of the tree - its branches and nodes - in the form of a concrete obstacle.) The sequence of nodes in which this line passes under them. If you go down "when" under "non", then you do not ensure that the "left side" node always comes first.

Used illustration (slightly different tree below)

While I do a search on Google, I get a conflicting definition for example:

inverter traversal Sequence: A, B, C, D, E, F, G, H, I blockquote>

But (my understanding) According to Definition # 1, it

, B, D, C, E, F, G, I, H should be

>

Can someone explain which definition is correct? Both of them can describe different translucency methods, but they use the same name. I understand that the academic text of the peer review is incorrect, but can not be fixed.

In my bad effort in the drawing, this is the sequence that shows how to choose them. alt text

Beautiful Pick up the node that is being pulled directly above the line.


Comments