搜索资源列表
BiTree
- 二叉树操作程序,实现了动态创建二叉树,中序遍历二叉树,节点删除等。-Binary tree procedures, the creation of dynamic binary tree traversal of binary tree node delete.
1
- 此代码可以创建二叉树并求出叶子节点总数和节点总数-This code can create a binary tree and calculated the total number of leaf nodes and the total number of nodes
tree
- C++创建二叉树及操作,完整的源代码,可以运行出DOS界面-C++ creation and operation of a binary tree, complete source code, you can run the DOS interface
feidiguibianlierchashu
- 先序创建二叉树,非递归算法遍历二叉树,输出先序、中序和后序序列。-First order to create a binary tree, binary tree traversal non-recursive algorithm, the output first sequence, inorder and postorder sequence.
CreateTree
- 用递归方法创建二叉树的算法,会提示某节点左儿子和右儿子的输入,避免一次输入所有节点导致出错的情形-Recursive method to create the binary tree algorithm, a node will be prompted son left and right inputs son, enter all the nodes to avoid a situation that caused the error
binary-tree
- 创建二叉树,搜索二叉树,包括前向遍历和后向遍历。-Create a binary search tree, including forward and backward traversal traversal.
BiTree
- 创建二叉树和统计非叶子结点,虽然比较简单,但很多地方都有用-create a BiTree and count the non-leaves nums
BinaryTree
- 创建二叉树,先序、中序、后序遍历二叉树的递归及非递归,和按层次便利二叉树的实现-Create a binary tree, preorder, inorder, postorder recursive and non-recursive binary tree, and at different levels to achieve a convenient binary tree
erchashu
- 创建二叉树、遍历(先序、中序、后序、层序)、计算(结点数、叶子数、高度、宽度)、查找(找结点、找双亲、找孩子、找兄弟,找祖先)、判断(二叉排序树、平衡二叉树、完全二叉树)、处理(左右子树互换,销毁、删子树、插子树、复制)等功能-Create a binary tree traversal (first sequence, sequence after sequence, sequence), calculated (number of nodes, number of leaves, heigh
Binary-tree
- 根据输入字符串创建二叉树,输出二叉树的先根遍历和后根遍历序列。-Creating and traversing a binary tree
Csharp003
- VS2010 C#编制的动态模拟创建二叉树程序。-design program to create a bitree with VS2010 C#
Btrade
- 创建二叉树,并实现二叉树的先序、中序、后序遍历。-realize the traversal of binary tree
ExchangeTree
- 先序创建二叉树,将二叉树所有节点的左右子树交换,再先序遍历输出-create a binary tree in first order, exchange all the nodes of the binary subtree , then preorder output
create_binarytree
- 因为程序中要知道叶子结点(终点),所以要将上面的二叉树变成扩展二叉树 (把叶子结点的孩子补成#, 用作标记),以此方式创建二叉树-create binarytree
222
- 创建二叉树和实现二叉树的三种遍历 根据提示输入字符型数据创建二叉树,输入值为所有字符型数据 输出为遍历后的每个结点的值的顺序 创建二叉树并能实现二叉树的先序、中序、后序遍历 -Create a binary tree and binary tree traversal three Create a binary input is all character data prompted, enter the character data The output value o
Cpp1
- 根输入字符串创建二叉树,输出二叉树的先根遍历和后根遍历-Root input string to create binary output binary tree traversal and after the first root root traversal
erchashu__jiedianzonngshu
- 初始化二叉树,创建二叉树,并计算二叉树总结点数,输出-Binary tree is initialized, create a binary tree, and calculate the tree summary points, output
Binary-Tree
- 二叉树通过字符串方式,能够创建相应的二叉树,而且可以递归实现。同样,对于任意的二叉树,可以生成对应的字符串。包括从指定字符串形式创建二叉树(包括空树和平凡树)、将二叉树按照指定的字符串形式输出、判断是否空树、 计算二叉树的结点总数、计算二叉树的叶子总数、计算二叉树的高度,其中空树和平凡树的高度分别为0和1、前序遍历输出二叉树,逗号分隔、中序遍历输出二叉树,逗号分隔、后序遍历输出二叉树,逗号分隔、将树清空等功能-By way of binary string, you can create t
shu
- 创建二叉树:广义表式创建和先序创建; 2) 遍历二叉树:先,中,后,层序遍历,广义表式遍历,凹凸式遍历; 3) 二叉树属性:深度,宽度,结点数,叶子结点数 4) 二叉树路径:叶子结点到根结点的路径; 5)二叉树线索:中序线索二叉树; 6)二叉树置空:清空二叉树。 -reate a binary tree: generalized table type creation and first order created 2) traversing b
BiTree
- 创建二叉树的c++代码,希望能够帮助到有需要的人-c++ code of Create a binary tree