搜索资源列表
Java-binary-tree
- 用Java编写的二叉树的数据结构,包括二叉树的每个节点的值,以及各子树的指针。 -Written in Java binary tree data structure, including the value of each node of a binary tree, and each sub-tree pointer.
Binary-Tree
- 二叉树通过字符串方式,能够创建相应的二叉树,而且可以递归实现。同样,对于任意的二叉树,可以生成对应的字符串。包括从指定字符串形式创建二叉树(包括空树和平凡树)、将二叉树按照指定的字符串形式输出、判断是否空树、 计算二叉树的结点总数、计算二叉树的叶子总数、计算二叉树的高度,其中空树和平凡树的高度分别为0和1、前序遍历输出二叉树,逗号分隔、中序遍历输出二叉树,逗号分隔、后序遍历输出二叉树,逗号分隔、将树清空等功能-By way of binary string, you can create t
binary-tree-traversal
- 二叉树的遍历 数据结构c/c++ 描述 开发环境为VS2013-Data structure c/c++ binary tree traversal
Binary-Tree-Traversal
- 本程序的功能是利用二叉树后序遍历来实现表达式的转换,同时可以使用栈来求解 后缀表达式的值。-The function of this program is to be implemented after preorder binary tree transform expression, and can use the stack to solve value postfix expression.
binary-tree
- 1.实现二叉树的下列运算: [1]输入一个二叉树的先序序列,生成二叉树的二叉链表 [2]显示其先序、中序和后序遍历结果。 [3]计算二叉树的叶子结点数。 [4]求二叉树的深度 2.编程实现二叉树的层次遍历 3.哈夫曼编码-1.operational binary tree: [1] Enter a first sequence binary tree sequence, generating a binary tree binary list [2] show
Binary-Tree-Recursive
- visual studio下的二叉树递归程序,C++,本人编写,实测可用-Binary Tree Recursive procedures under visual studio, C++, I prepared, Found Available
Binary-tree-arithmetic-calculation
- 构建二叉树结构进行四则运算。在控制台程序中输入书写习惯的表达式(可以包含括号),程序首先遍历提取运算符号,分辨优先级,然后构造二叉树,对二叉树后序遍历,运算得到结果。 输出运算结果和遍历顺序。-Construction of the structure of four binary arithmetic. Enter the writing habits of expression in the console program (may contain parentheses), the pro
binary-tree
- 数据结构课程设计 已知二叉树的前序遍历序列和中序遍历序列,确定唯一的一棵二叉树。-Data structure course design The preamble of known binary tree traversal sequence and the sequence traversal sequence, to determine the only a binary tree.
Reconstruction-of-Binary-Tree
- 实现了二叉树的重构,根据二叉树的顺序可以重构一颗二叉树,输入先序、后序遍历的结构,重构出一颗二叉树。-Reconstruction of Binary Tree
Binary-tree
- SEARCH insert delete in a binary tree by using stack C++ visual
Binary-Tree
- (1)从键盘上输入数据,建立二叉链表。 (2)前序遍历、中序遍历、后序遍历二叉树:递归算法。 (3)前序遍历、中序遍历、后序遍历二叉树:非递归算法。 (4)借助队列实现二叉树的层次遍历。 在主函数中设计一个简单的菜单,分别调试上述算法。-(1) input data the keyboard, build binary list. (2) former preorder, preorder, after preorder binary tree: recursive al
Preorder-binary-tree
- 使用C语言非递归方式实现中序遍历二叉树,-Non-recursive manner using C language to achieve binary tree traversal,
Binary tree
- binary tree code for algorithum
Binary-tree
- 输入先序数列和中序数列得出后序数列并打印二叉树-Enter the order of precedence and the order of the sequence of the order of the second series and print binary tree
Binary tree
- 利用平衡二叉树,将输入数字排列成左小右大的二叉树,内附代码和文件说明(Using the balanced binary tree, the input number is arranged into a left small right large two fork tree, with the enclosing code and file descr iption)
binary tree
- 实现二叉树,实现三种遍历,计算结点数等操作(The realization of the two binary tree)
binary tree
- 二叉树的创建和非递归遍历,包括先序遍历,中序遍历,后序遍历(the creation and non-recursive traversal of binary tree)
二叉树.cpp
- 二叉树的基本操作,二叉树的中序,先序遍历,后序遍历,层次遍历,二叉树家电个数以及二叉树的复制操作的实现(The basic operation of the binary tree)
BinaryTree
- Binary Tree implemented in Visual C++
Binary Tree
- 1. 编写建立二叉树的二叉链表存储结构,并用广义表的形式显示; 2. 在二叉树的二叉链表存储基础上,实现二叉树的先序线索链表结构,并显示和存储二叉树的相应的线索链表; 3. 在二叉树的先序线索链表存储结构上,实现求任一个结点的先序的后继和前驱结点的算法; 4. 实现对先序线索二叉树的先序遍历的非递归算法,显示相应的遍历序列。(The establishment of preemptive clue binary tree and preorder traversal)