Can anyone tell me the pros and cons of the three traversals of a binary tree?

Complete**, the global variable outstr contains the traversal result.

It's OK to run, but there's a problem, how do you display the data stored in the stack every time the stack changes?

pnode (You can't use it that way.)

uses

type.

pnodenode;

noderecord

datastring;

lchild,rchild

pnode;

end;procedure

inorder(p:

pnode);

vars:tstack;

begins:=;

dobegin

nildobegin

end;p:=;

thenbegin

p:=;strout:=strout+p^.data+##

end;end;

end;

The access path is the same for the three algorithms. It's just that the timing of accessing the node is different.

First. Minor menstruation.

Outdated access is.

Pre-order traversal. The second passing time visit was.

Middle-order traversal. The third passing time visit was.

Post-order traversal. Quote the conclusion of the Internet.

I feel that there are no shortcomings in the three, and there are good points. It's just that a specific algorithm is used according to the specific needs.

Search for "C implements binary trees (modular integration, recursive and non-recursive implementations of traversal)", which is a blog post in the blog park, which is more comprehensive about the recursive and non-recursive algorithms for the front, middle and back layers of binary trees.

I just learned the binary tree, if there is any mistake, please correct.

You can understand it this way:

Nodes: Refers to the points in the binary tree, which are the ones in the figure below;

Degree: Refers to how many child nodes there are under the parent node, give two examples and you will understand. For junction 1, he has two children below, so the degree of junction 1 is trembling chakra 2; For junction 4, he doesn't have any children below, so the degree of junction 4 is 0;

Placing it in traversal is a little cumbersome, but to grasp the following points on it (no matter what big or small the tree is):

Forerunner: The root node is the first to visit, then the left and right children are visited;

Sequence: The root node is visited last, and the left and right children are interviewed first;

Middle order: The second visit to the root node, the left child is visited first, and the right child is visited last.

The following picture is an example: I will write the answer to you, and you will study it yourself

Pre-sequence: 0134256

Later Lease Sequence: 3415620

Intermediate sequence: 3140526

Traversal Rules:

Post-order traversal, left-right-root dbe fcg a mid-order traversal, left-root-right dbe a fcg pre-order traversal, root-left-right a dbe fcg