搜索资源列表
Binary-Tree-levorder
- 用C++实现二叉树中的层次遍历（Binary_tree.cpp中），levorder，用的是队列-Use C++ achieve the the hierarchical traversal (Binary_tree.cpp) binary tree, levorder, the queue
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
binary-tree
- 虽然代码有点负责，但此代码不同于经典二叉树后序编译，以枚举法对各种条件进行分析-Although the code is responsible for a bit, but this code is different from the classic binary tree postorder compiled enumeration method to analyze a variety of conditions
Binary-tree
- 二叉树程序，内涵多个报错功能，不错的,欢迎下载-Binary tree program, the connotation multiple error function good.
Binary-tree-traversal
- 二叉树遍历，前序遍历 中序遍历 层次遍历 非递归方法-Binary tree traversal
Binary-Tree
- How to build a dictionary using Binary Tr-How to build a dictionary using Binary Tree
binary-tree
- 二叉树的简单应用，建立、遍历以及递归实现二叉树的应用-the binary tree
Binary-Tree-reversal
- 数据结构二叉树反转的C++代码，欢迎批评指正，相互学习-c++ for Binary Tree reversal
binary-tree-postorder-traversal
- 二叉树非递归后序遍历,数据结构中常见的面试考题-Non-recursive binary tree postorder traversal
traversal-of-binary-tree
- 软件基础实验中的二叉树遍历C代码，比较基础，希望可以通过-traversal of binary tree
Binary-tree-structure
- 从文件中接受一组数，动态创建一个二叉树，并且先序中序和后序遍历-Accept a set of numbers, from a file dynamically create a binary tree, and the first sequence in the sequence and after preorder
binary-tree-collision-code
- 射频识别技术里的二进制树碰撞代码，防碰撞能力-Radio frequency identification technology in the binary tree collision code, anti-collision
Balanced-binary-tree-operation-two
- 该程序主要是针对平衡二叉树的操作而设计的，程序执行的命令包括： （1）构造平衡二叉树；（2）输入数据； （3）对平衡二叉树的查找、插入、删除操作；（4）结束 -The program is mainly aimed balanced binary tree operation and design, program execution commands include: (a) construct a balanced binary tree (2) the input data
binary-tree
- 二叉树的建立以和先序、中序、后序遍历以及层次遍历，还可以查找并删除节点等-the basic function of binary tree
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
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 ~ ~ ~)
Balanced-Binary-Tree
- 基本实现平衡二叉树的创建，插入和删除操作。使用C++代码实现-Basic balanced binary tree to create and delete operation.