搜索资源列表
binary-tree
- 一个VC环境下动画模拟二叉树的c++小程序-Applet animation of a binary tree in a VC environment
Binary-Tree-reversal
- 数据结构二叉树反转的C++代码，欢迎批评指正，相互学习-c++ for Binary Tree reversal
binary-tree-in-templates
- so i want to make a code, that creates a binary tree, that holds data, for example ints like 1,6,2,10,8 and on pop i get the biggest number, and after that it gets deleted from the tree, and on push i can insert a new element. And this should be in a
traversal-of-binary-tree
- 二叉树的建立，对于电网模型层次结构实现遍历搜索-traversal of binary tree
binary-tree-postorder-traversal
- 二叉树非递归后序遍历,数据结构中常见的面试考题-Non-recursive binary tree postorder traversal
traversal-of-binary-tree
- 软件基础实验中的二叉树遍历C代码，比较基础，希望可以通过-traversal of binary tree
Binary-tree-in-the-establishment
- 二叉树的建立 中序遍历二叉树 把二叉树转换成双向链表-Binary tree in the establishment of traversing Binary conversion to binary tree into a doubly linked list
CPP-achieve-binary-tree
- C++实现二叉树 树（森林）的广义表（括号表示法）重建树（森林） 请输入树（森林）的广义表（括号表示法）（以#结束）-C++ generalized list (in parentheses notation) to rebuild the tree (forest) Please enter the tree (forest) binary tree tree (forest) generalized table (bracket notation) (# end)
Binary-Tree
- 对二叉树进行操作，包括二叉树的创建和对二叉树进行深度和广度优先遍历-Operations, including the creation of a binary tree, and the depth and breadth-first traversal of a binary tree on binary tree
complete-binary-tree--traversal
- 完全二叉树的前序、中序、后序、层次遍历 使用JAVA实现 精确简洁 使用最小的空间实现最全的功能-Complete binary tree before order, in sequence, after the level traversal using JAVA achieve accurate and simple to use minimal space to achieve the most complete functionality
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
- 二叉树的建立于遍历，编写程序实现建立于遍历-Binary tree was established in the traversal, write a program to fulfilling the challenge of to establish on the traversal the
binary-tree
- 1．掌握二叉树的概念和性质 2. 掌握完全二叉树存储结构。 3．掌握完全二叉树的基本操作 4.创建完全二叉树（用字母表示节点）(用顺序方式存储) 5.求二叉树的深度和叶子结点数 6.实现二叉树的前序、中序、后序和层次遍历。 7.查找给定结点的双亲、祖先和左右孩子节点。 -1. Grasp the concept and nature of the binary tree master the complete binary tree storage stru
The-binary-tree
- 二叉链表的C语言描述 基本运算的算法——建立二叉链表、先序遍历二叉树、中序遍历二叉树、后序遍历二叉树、后序遍历求二叉树深度 -The binary tree algorithm C language to describe the basic operations- the establishment of the binary tree, preorder traversal of a binary tree traversal of binary tree, after traver
binary-tree-collision-code
- 射频识别技术里的二进制树碰撞代码，防碰撞能力-Radio frequency identification technology in the binary tree collision code, anti-collision
Sets-binary-tree-algorithm
- 本实例实现了二叉树相关的一系列算法，包括建立二叉树、二叉树的前序、中序和后序遍历、统计数的结点数和叶子结点数。-The examples of the binary tree algorithm, including the establishment of a binary tree, binary tree preorder, inorder, and postorder traversal, statistical number of nodes and leaf nodes.
Ordered-binary-tree
- 搜索有序二叉树 C语言实例解析中的经典代码 简单易懂 功能强大-Ordered binary tree search
binary-tree-traversal
- 程序功能：遍历二叉树，线索化二叉树，遍历线索化二叉树，二叉树去线索化-The program features: binary tree traversal, threaded binary tree traversal threaded binary tree, binary tree to clues
Binary-tree-reconstruction
- 二叉树的重建 Descr iption 给定二叉树的先序遍历序列和中序遍历序列，重建二叉树，并对其进行后序遍历。 Input 第一行为一个整数t（0<t<10），表示测试用例的数目。以下t行，每行输入一个测试用例，包含两个字符序列s1和s2，其中s1为一棵二叉树的先序遍历序列，s2为中序遍历序列。s1和s2之间用一个空格分隔。序列只包含大写字母，并且每个字母最多只会出现一次。 Output 对于每个测试用例，用单独一行输出对该二叉树进行后序遍历得到的字符序列，
binary-tree-
- binary tree 框架用于学习数据结构教学 是一个简单的二叉树-binary tree data structure for learning teaching framework is a simple binary tree