Algorithm of the list of nodes when traversing in reverse ordering

Question

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 high-quality assimilation of this topic.

Nicolas Chabanovsky ♦ 38.2k 54 222 438 · Accepted Answer · 2011-05-02T07:26:16

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?
To put it simply, then each vertex (node) of a tree can have as many subtrips (sub-nodes or children), and each vertex of a binary tree has no one, two.
I would recommend to look at the above book, there is a chapter about B-trees, which are a generalization of binary ones, and nodes of such trees may have a lot of child nodes.
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.
other topics are just for reverse, forward and symmetric traversal, which, as you said, is more like binary trees.

Algorithm of the list of nodes when traversing in reverse ordering

1 answer 1

More articles: