二叉树的四种遍历方法和两种求深度的方法(国外英文资料).docVIP

二叉树的四种遍历方法和两种求深度的方法(国外英文资料) Four of the two fork tree traversal method and two methods for the depth of.Txt and the mood of aftershocks, like the first love lover girl, afraid he does not come, and feared him. I heard The woman is like the clothes, Brothers are like hands and feet., in retrospect, I actually all flurry and confusion streaking more than 20 year! Im in a bad mood today. I only have four sentences to say, including this sentence and the first two sentences! Four traversal methods of two trees and two methods for finding depth Using the previous knowledge of the stack and queue, is also a kind of review. However, when you use the stack for depth, you change the two fork tree, and you dont know how to avoid it Two / tree.Cpp: entrance point console application. #include stdafx.h #include stdio.h #include stdlib.h Typedef struct BiTNode{/ / two tree structure Int data; Struct, BiTNode, *lchild, *rchild; }BiTNode, *BiTree; #define STACK_INIT_SIZE 100 #define STACKINGMENT 10 Int CreateBiTree (BiTNode **T) / / first order in order to establish the two fork tree { Char c; If ((c) = getchar () =#) *T = NULL; Else { If (= *T = (BiTree) malloc (sizeof (BiTNode))) { Printf (ERROR!); Return 0; } (*T) -data = c; CreateBiTree ( (*T) -lchild); CreateBiTree ( (*T) -rchild); } Return 0; } Int PrintfElement (int E) { Printf (%c, e); Return 1; } Int PreOrderTraverse (BiTree T, int (* PrintfElement) (int E)) / / recursive method of preorder traversal of binary tree two { If (T) / access node { If (PrintfElement (T-data)) If (PreOrderTraverse (T-lchild, PrintfElement)) / / the first traversal of the left subtree If (PreOrderTraverse (T-rchild, PrintfElement)) / / the first traversal of the right subtree Return 1; Return 0; } Else Return 1; } Int InOrderTraverse (BiTree T, int (*PrintfElement) (int)) / / recursive method in order traversal binary tree two { If (T) { If (InOrderTraverse (T-lchild, PrintfElement)) If (PrintfElement (T-data)) If (InOrderTraverse (T-rchild, Pri