搜索资源列表
BinaryTree
- 二叉树建立，插入，删除，遍历范例，是学习数据结构的一个实例-Binary tree set up, insert, delete, traverse example, are studying an example of data structure
binarytree
- 本程序用C语言编写在VC6.0的环境下运行，主要是二叉树的建立-creat binary tree
BinaryTree
- （1）根据给定二叉树的先序遍历和中序遍历结果，构造出该二叉树； （2）给出该二叉树的后序遍历结果； （3）判定该二叉树是否为平衡二叉树； -(1) According to the given binary tree preorder traversal and inorder traversal a result, constructed out of the binary tree (2) given in the post-order traversal of the bin
BinaryTree
- 在VC++环境下实现二叉树的相关操作-In the VC++ environment to achieve the related binary operation ... ...
BinaryTree
- 二叉树的相关操作，实现前序，中序，后序遍历，算元素个数，树高-Binary tree-related operations, to achieve pre-order, middle order, postorder, count number of elements, tree height,
BinaryTREE
- 使用visual c++實作二元樹，示範物件導向語言-using C++ to implement a bianary-tree
BT
- 二叉树的前序遍历以及中序遍历以及后序遍历-BinaryTree
binarytree
- 主要为怎样建立一个二叉树，功能比较简单,描述的时间里二叉树的工程-It s main function is to show you how to build a binary tree
BinaryTree
- C++ implementation of Binary Tree, SearchTree and LexicalTr-C++ implementation of Binary Tree, SearchTree and LexicalTree
BinaryTree
- 二叉树的递归遍历，包括前中后三种遍历，并且采用先序输入-Recursive binary tree traversal
BinaryTree
- 二叉树的建立，非递归前中后序遍历，判断二叉树的相似，实现二叉树中左右子树的交换-The establishment of a binary tree, taken in the order of non-recursive traversal of binary tree similar to the judge, to achieve a binary tree in the exchange of left and right subtree
BinaryTree
- 数据结构使用三叉链表表示的二叉树的基本操作-Data structures using the binary tree expressed in the trigeminal lists the basic operation of
BinaryTree
- 二叉树实现代码。包含了dev和vc实现的源码，是学习数据结构的很好的参考。-The complement of BinaryTree using c++
binarytree
- Ｃ＋＋写的二叉树链表，创建二叉树使用非递归的方法，计算个位数的。-The C++ to write the binary tree linked list, create a binary tree using a non-recursive method to calculate the single digits.
BinaryTree
- 判断两棵二叉树是否相似，输入两棵二叉树，可以判断他们是否相似-Determine whether two binary tree is similar to input two binary tree, you can judge whether they are similar
BinaryTree
- 定义二叉树的类，包含的插入、中序遍历、后序遍历、先序遍历的操作-Define the binary tree class contains insert, in order traversal post-order traversal, preorder traversal operation
binaryTree
- 根据输入的谦虚序列，终须序列获得二叉树，从而进行“前序”“中序”“后序”“层次”遍历，支持单步演示以及自动演示-Eventually have modest sequence based on the input sequence obtained binary tree, thus the " preamble" in order " after the sequence" hierarchy traversal supports single-step d
BinaryTree
- 包括二叉树的前序、中序、后序递归非递归遍历；以及线索二叉树的前序、中序、后序递归非递归实现。-Include binary tree preorder, inorder, postorder recursive non-recursive traversal threaded binary preorder, inorder, postorder recursive non-recursive implementation.
BinaryTree
- 二叉树实现，整个包为VS工程。包含了二叉树的基本功能-Binary Tree, the entire package is VS works. Contains the basic functions of the binary tree
BinaryTree
- BinaryTree.rar 二叉链表的一些操作-BinaryTree.rar Some operations binary list of