搜索资源列表
Binary-Tree
- 关于二叉树的一些基本操作：创建、遍历、结点数、高度、交换左右孩子、等等。-Some basic operations on binary tree: Create, traverse, nodes, height, exchange or so kids, and so on.
Experimental-binary-tree-traversal
- 二叉树的创建及遍历实验 要求：数据元素类型ElemType取float。 1）从键盘按照前序遍历的顺序依次输入二叉树的各元素，创建此二叉树。 2）对该二叉树进行层次遍历，并输出遍历后的序列。(参照图的广度优先搜索)-Binary tree traversal create and test requirements: data element types ElemType take float. 1) from the keyboard in accordance with the
non-recursion-of-binary-tree
- 非递归建立二叉树，可以直接运行。采用堆栈的方法建立二叉树，而不是递归，展示了堆栈的先进后出的特性。数据结构的内容-Establishment of non-recursive binary tree can be run directly. Method to create a binary tree using the stack instead of recursion, showing advanced after stack features
The-basic-operation-of-a-binary-tree
- 二叉树的基本操作。包括树的（先序、中序、后序）创建、树的遍历（先序、中序、后序）、树的高度、树的宽度、树的叶子节点数-The basic operation of a binary tree. Including tree (first order, in sequence after sequence) created tree traversal (first order, in sequence after sequence), tree height, tree width, tree
All-the-basic-binary-tree
- 二叉数的全部基本操作，包括二叉树的建立及各种遍历，二叉树的各种信息，二叉树的各种操作-Total number of binary operations, including the establishment of tree and a variety of traversal, binary tree variety of information, a variety of binary operations
Binary-tree-traversal
- 二叉链表遍历，可以使用递归和非递归方法实现二叉树的前序，中序和后续遍历，以及层序遍历-Binary tree traversal, you can use recursive and non-recursive method to achieve binary tree preorder, inorder traversal and follow-up, as well as layer preorder
Binary-Tree
- POJ 文本二叉树 总的来说，又是数算作业啦啦啦（是自己写的哦~~~）-POJ text binary tree in general, but also to count jobs la la la (write by myself own oh ~ ~ ~)
binary-tree
- 程序的菜单功能项如下： 1------建立一棵二叉树 2------前序遍历递归算法 3------前序遍历非递归算法 4------中序遍历递归算法 5------中序遍历非递归算法 6------后序遍历递归算法 7------后序遍历非递归算法 8------求树高 9------求叶子总数 10-----输出二叉树 11-----退出 -Menu functions in program are as follows: 1------ 2-
Binary-Tree
- 实现唯一的确定一棵二叉树，该方法相对简单方便。-Achieved only determine a binary tree, the method is relatively simple and easy.
the-static-binary-tree-and-input
- 建立一个静态二叉树，并对他进行先序遍历，已在vc6.0上运行通过。-To establish a static binary tree, and carries on his first sequence traversal, has run through in vc6.0
Binary-tree
- 根据输入字符串创建二叉树，输出二叉树的先根遍历和后根遍历序列。-Creating and traversing a binary tree
Binary-tree-traversal-algorithm
- 数据结构中，实现二叉树的遍历，包含前序，中序和后序-Data structure, binary tree traversal, including former preorder, inorder and postorder
binary-tree
- 二叉树的基本算法代码，包括插入节点、删除节点、遍历二叉树等基本算法。-Binary basic algorithm code, including insert nodes, delete nodes, and other basic binary tree traversal algorithm.
binary-tree-amplitude
- 这是我参加某公司面试时做的一个二叉树问题题目，题目是求任意给出一组数看是否在树上，并求节点和数的裕度。这是我的答案，给大家分析参考。-This is a binary tree question when I participate a company s interview. The question is judging if a random series number is in binary tree and get the node and tree s amplitude.It s
binary-tree
- 用二叉链表存储二叉树，用“扩张先序遍历序列”创建二叉链表，对二叉树进行前、中、后序的遍历以及层次遍历，输出度为0、1、2的节点及节点数，线索化二叉树，根据线索化的二叉树查找二叉树中任意节点的前驱、后继，通过线索二叉树进行二叉树节点的删除、插入，以及按树状打印二叉树。-Used to store binary tree binary tree, use the " expansion preorder sequence" to create the binary tree, th
Highly-balanced-binary-tree
- 平衡二叉树它是一 棵空树或它的左右两个子树的高度差的绝对值不超过1，并且左右两个子树都是一棵平衡二叉树。-The absolute value of difference in height which is balanced binary tree or a tree left empty subtrees not more than 1, and the left and right sub-trees are balanced binary tree.
Binary-tree-traversal
- 二叉树遍历，有先序遍历，中序遍历，后序遍历等遍历方法的java实现-Binary tree traversal, there are preorder, java preorder, postorder traversal methods, such as the realization of
Binary-tree-shortest-path-summation
- 这是一个数据结构中二叉树的最短路径求解的问题的源代码打包，代码简明易懂，方便初学者的学习-This is a binary tree data structure for solving the shortest path problem' s source code package, code easy to understand, easy for beginners to learn
Binary-Tree
- 生成二叉树，前序、中序、后序遍历二叉树。可以使用菜单选择。-Generate binary tree, preorder, inorder, postorder tree traversal. You can use the Select menu.
binary-tree
- 在VC 6.0环境中用C++语言实现对数据结构中二叉树算法进行描述，共包括五个例程-VC 6.0 environment using C++ language of binary tree data structure algorithms described, including a total of five routines