二叉树的建立与遍历,叶子结点的数目以及树的深度的求法,采用递归求解(国外英语资料).docVIP

二叉树的建立与遍历,叶子结点的数目以及树的深度的求法,采用递归求解(国外英语资料) The establishment of binary tree and traversal, the method to get the number of leaf nodes and the depth of the tree, the recursive solution. TXT what I dont entertain wild hope, only hope that after you as a woman. When I was a child, I could be a man like a man. I wrote it personally, its a very simple record, hehe. My baidu space: /heihei_shaweiwei/blog/item/eec5a3de6bb28c0462279805.html # include iostream Using namespace STD. / / the structure of the tree Typedef struct _binTree { Char data; _binTree * lNode. } binTree; / / create a binary tree Void createT (binTree * rootNode, binTree * tempNode) { If (rootNode = = NULL) { RootNode = tempNode; The return; } The else { If (rootnode- data tempnode- data) { CreateT (rootnode- lNode, tempNode); } Else if (rootnode- data tempnode- data) { CreateT (rootNode - rNode, tempNode); } } } / / print the number that has been created Void printT (binTree * rootNode) { If (rootNode = = NULL) return; The else { PrintT (rootNode - lNode); Cout rootNode - data ; PrintT (rootNode - rNode); } } / / first order traverses the binary tree Void preTraverse (binTree * rootNode) { If (rootNode = = NULL) return; The else { Cout rootNode - data ; PrintT (rootNode - lNode); PrintT (rootNode - rNode); } } / / in order to traverse the binary tree Void midTraverse (binTree * rootNode) { If (rootNode = = NULL) return; The else { PrintT (rootNode - lNode); Cout rootNode - data ; PrintT (rootNode - rNode); } } / / in order to traverse the binary tree Void lastTraverse (binTree * rootNode) { If (rootNode = = NULL) return; The else { PrintT (rootNode - lNode); PrintT (rootNode - rNode); Cout rootNode - data ; } } / / the total number of nodes Int nodeTotal (binTree * rootNode) { If (rootNode = = NULL) return 0; The else { Return 1 + nodeTotal + nodeTotal (rootnode- rNode); } } / / calculate the depth of the binary tree Int treeDepth (binTree * rootNode) { If (rootNode = = N