I am writing a term paper, but there is a problem with a lack of teaching materials. Topic "Algorithm of the list of nodes when traversing in reverse ordering". I want to ask you to help in the search, as well as indicate the direction of movement for the most rapid and highquality assimilation of this topic.
1 answer
I understand that there is a binary tree that needs to be circumvented by going round (or else they say right) and organize the resulting sequence of nodes into a list.
On the wiki , in general, you can learn about binary trees and algorithms associated with them.
I also advise you to find a book: "Algorithms. Construction and Analysis" Kormen, Lejzarson, Rivest, Stein. It describes in detail the data structures, including binary trees, and algorithms for working with them (the algorithms are given with strong proof, which, I think, is welcome in term paper).
 I am a newbie in this tee, so maybe ask a stupid question: Are trees and binary trees the same thing?  Andrey Maslov
 No, this is not the same thing. To put it simply, then each vertex (node) of a tree can have as many subtrips (subnodes or children), and each vertex of a binary tree has no one, two. Look here ru.wikipedia.org/wiki/…  Igor Loban
 Yeah, thanks, figured it out. But I just need trees, ordinary. I will search :)  Andrei Maslov
 2Ooh, ordinary means. I would recommend to look at the above book, there is a chapter about Btrees, which are a generalization of binary ones, and nodes of such trees may have a lot of child nodes. There are no bypasses of such trees in the book. Of course, it is possible to bypass it if the nodes are ordered by the corresponding criterion. Usually, the reverse (like the direct and symmetrical) traversal is associated with binary trees. In any case, good luck with your search! :)  Igor Loban
 Although it is possible trees and binary, because other topics are just for reverse, forward and symmetric traversal, which, as you said, is more like binary trees.  Andrey Maslov
