搜索资源列表
BinaryTree
- 创建二叉树类。二叉树的存储结构使用链表。 提供操作:前序遍历、中序遍历、后序遍历、层次遍历、计算二叉树结点数目、计算二叉树高度。 -Create a binary tree class. Binary tree using linked list storage structure. Provides operations: pre-order traversal, inorder traversal, postorder traversal, traverse levels to ca
tree
- 运用递归算法创建二叉树,并实现先序、中序、后序排列-Recursive algorithm used to create binary tree, and to achieve the first order, in order, after the sequence alignment
btree
- 先序递归创建二叉树,计算二叉树中叶子节点的个数-Create a binary tree recursive first order to calculate the number of leaf nodes in binary tree
2Treeback
- 创建二叉树,由中序和后序(或后序)恢复二叉树。-The creation of a binary tree,In the sequence and sequence (before or after sequence) resume binary tree
Binary-tree
- 创建二叉树,先序中序后序递归二叉树,求叶子数目,求树高,左右子树交换。-Create a binary tree, in order of first-order recursive post-order binary tree, find the number of leaves, tree height requirements, exchange of left and right subtrees.
binaryTree
- 基于VC++语言,通过双向链表法创建二叉树。此PPT将分享我如何将二叉树形象的比喻成为双项链。-Based on VC++ language, create a binary tree by two-way linked list method. I will share this PPT binary image of how the metaphor of a double necklace.
BiTree
- 实现的功能包括创建二叉树,按层遍历、递归遍历,统计度为0、1、2的节点数,求深度,判断是否是完全二叉树,求节点的父节点,交换左右子树,文件读写-create BiTree,traverse bitree,node s ancestor, exchange left and right childtree
binarytree
- 创建二叉树,用坐标进行前序,中序,后序以及图形显示操作-create a binarytree,and postoder,midorder,preorder and show with coodination
Tree
- 创建二叉树,实现二叉树的前序遍历,中序遍历,后续遍历,层次遍历等功能!-Create a binary tree, realize the binary tree of the preface of the traverse, in order to traverse, the follow-up to traverse, the function such as level traversal!
BinaryTree
- 二叉树二叉链表实现 (1) 构造(包括拷贝构造)和析构函数(删除所有结点函数); (2) 根据用户输入的先序遍历序列构造二叉树; (3) 打印二叉树(可以使用先序、中序、后序遍历实现); (4) 分别求二叉树中所有结点的个数;叶子结点、分支结点的个数; (5) 分别求二叉树的高度(层次数); (6) 按层次打印二叉树; (7) 使用另一种方式创建二叉树:规则:左子树的值都比根结点小,右子树的值都不比根结点小; -Binary Tree
Binary-tree-computing
- C语言,输入一个表达式,根据表达式创建二叉树,并计算该表达式的值,源代码-C language, enter an expression, according to the expression to create a binary tree, and calculate the value of the expression, the source code
base1
- vc开发的二叉树实现程序,创建二叉树时,采用先序(node-left-right)的方式,每输入一个结点值(字符),敲一下回车键,再输入下一个节点值,空结点值用 * 表示,每个叶子节点必须后跟两个空指针,并输出了它的中序遍历形式和绘图的形式,有助于初学者加深对二叉树概念的理解-Vc development of binary tree realize the program, creating a binary tree, the first order (node-left-right) wa
Balance-two-forks-tree
- 将二叉排序树转变为平衡二叉树,其操作有:创建二叉树、插入数据、 删除数据、输出、销毁二叉树和退出 -Binary sort tree into a balanced binary tree, its operations are: create a binary tree, insert data, delete data, output, the destruction of the binary tree and exit
The--operation--binary-tree
- 程序的主要功能 1 按照二叉链表存贮创建二叉树 2 二叉树的遍历——先序中序后序 三种不同方式遍历 3 统计总结点与叶子节点的个数 4 树状打印二叉树 注释清楚-The main functions of the program 1 according to the binary linked list storage create binary tree 2 binary tree traverse--first order after order sequ
binarytree
- C++写的二叉树链表,创建二叉树使用非递归的方法,计算个位数的。-The C++ to write the binary tree linked list, create a binary tree using a non-recursive method to calculate the single digits.
tree
- 创建二叉树并以根结点为参数交换每个结点的左右子树,查找x结点并输出其所有的祖先结点,以中序遍历和前序遍历创建二叉树。-Create a binary tree and parameter exchange for each node of the root node to the left and right subtree, find x nodes and output nodes of all its ancestors, create a binary tree in order tra
9
- 基于先序遍历算法创建二叉树先序遍历中序遍历后序遍历采用后序遍历求二叉树的深度、结点数及叶子数的递归算法-Create a Binary Tree in preorder traversal preorder traversal algorithm after preorder postorder traversal binary tree of depth, the number of nodes, and leaves the number of recursive algorithm
lab4_2
- 2-1以顺序栈作为存储结构 实现顺序栈的入栈运算,出栈运算,并且读取栈顶元素; 2-2以链栈作为存储结构,实现栈上的数据元素的插入运算,删除运算,并读取链栈的栈顶元素; 2-3 以循环队列喂存储结构,实现循环队列的建立,实现循环队列的入队运算,出队运算; 2-4用栈实现括号的匹配问题; 2-5实现汉诺塔问题.; 3-1采用链式存储表示,按给定的先序序列创建二叉树,并输出二叉树。 3-2-1和3-2-2采用二叉链表作为存储结构,建立二叉树,采用递归算法实现二叉树遍历,另外采
erchashu
- 验证二叉树的二叉链表表示,实现CreateBiTree算法创建二叉树,实现二叉树的层次遍历算法,实现二叉树的先序、中序、后序递归遍历算法中的一种,编写主程序调用CreateBiTree创建二叉树,并调用二叉树的层次遍历、先(中、后)序遍历算法,测试不同的输入数据创建二叉树,预期输出并验证输出的结果。 -The binary list validation binary tree the preorder achieve CreateBiTree algorithms to create a
tree
- 创建二叉树,按顺序输入各节点的数据,返回该二叉树的中序遍历结果。-Create a binary tree, in order to enter the data of each node, and returns the binary tree traversal sequence results.