搜索资源列表
-
0下载：
binary search tree
/*class TreeNode {
public:
TreeNode(char m[80],TreeNode*left, TreeNode *right)
void Inorder(void)
char data[80]
TreeNode *left_ptr
TreeNode *right_ptr
}
-
-
0下载：
This program creates a binary Search Tree, traverse it in pre, post and inorder and also create the mirror image of the binary tree.
-
-
0下载：
二叉树的创建和二叉树的遍历，先序，中序，后序等遍历的实现。-Binary tree creation and traversal of the binary tree, preorder, inorder, and postorder traversal.
-
-
0下载：
创建一颗二叉树，并且可以用前序、中序、后序进行遍历。-Create a binary tree, and you can preorder, inorder, and postorder traversal.
-
-
0下载：
设二叉树结点值为大写字母，输入二叉树的前序遍历和中序遍历序列，生成此二叉树，输出该二叉树的后序遍历和按层次遍历序列。输入某结点值，在二叉树中查找该结点，若该结点存在，则输出从根到该结点的路径，否则给出不存在信息。
-Let binary tree node value of capital letters input binary tree preorder traversal and inorder traversal sequences, this binary tree is gene
-
-
0下载：
MFC实现二叉搜索树，输出先序，中序和后序遍历结果。-MFC binary search tree, output preorder, inorder and postorder traversal results.
-
