搜索资源列表
Binary
- 二叉树 VC++， 通过VC++编程，生成二叉树，具有遍历的功能-Binarytree VC++
a
- 二叉树的先序递归非递归遍历，中序递归非递归遍历，后序递归非递归遍历，以及节点数-Binary tree preorder recursive traversal non-recursive, recursive sequence of non-recursive traversal, postorder recursive non-recursive traversal. As well as the nodes
pretree
- 采用C语言编写的先序遍历二叉树的源程序，该程序有3部分构成：主程序，构造树函数，先序遍历函数-Written in C language using the first order binary tree traversal of the source, the program has three parts: the main program, construct a tree function, preorder traversal function
42
- 多元树的层次遍历、先根遍历、后根遍历 涉及的知识点：多元树的表示法、先根遍历、后根遍历的递归算法、多元树的层次遍历方法-Multi-level tree traversal, first the root traversal, traversal involved in dorsal root knowledge point: multi-tree representation, first the root traversal, after the root of the recur
tree
- 二叉树的基本操作，例如前序遍历，后序遍历，层序遍历-tree
Binary_Tree
- 用c#实现二叉树(二叉树的前序,中序,后序遍历,以及删除节点等功能)-To use c# to achieve binary tree (binary tree preorder, inorder, postorder, and delete nodes and other functions)
pengyunhui-4
- 采用llink-rlink方式存储二叉排序树，编写能够通过键盘输入建立二叉排序树，并在建立完立即在屏幕显示中序遍历结果的程序。-Llink-rlink stored using binary sort tree, write through keyboard input the establishment of two binary sort tree, and in the establishment of finished immediately display the results in
Tree
- 用递归调用的思想创建二叉树并对其进行先序、中序以及后序遍历-Recursive call with the idea to create a binary tree and gain first-order, middle order, and postorder
bitreefifth
- 二叉树的创建，线索化，遍历，表达式树求值等-Binary tree creation, threaded, traversal, expression tree evaluation, etc.
erchashubianli
- 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。将一棵二叉树的所有左右子树进行交换的算法。-Prepared using binary list stored in binary form of the creation, the first sequence, the sequence, after the order and by level traversal algorithms. Will be a left sub-tree of all binary ex
Tree
- 二叉树的先序、中序、后序遍历 以及生成凹入表-The preorder,inorder and postorder traversal of a binary tree.
five
- 二叉树的基本操作，初始化，找结点，孩子结，层数，遍历-Binary tree basic operations, initialization, find node, the child node, number of storeys, traverse
delphi_qxgl
- 用delphi写的用户权限管理 修改了权限树节点状态生成过程，采用循环遍历树结点 修改了主界面菜单和工具条显示过程，采用递规遍历菜单 通过系统管理员进入sys权限设置，在mainfrom创建的时候读取权限。 权限设置模块中可根据需要改为：将树型结构的节点写进数据库，进行动态修改。在程序中动态生成树型结构 过系统管理员:sys 密码:sys 普通用户:001 密码:123 用VB、VS等开发工具可参考设计。-Use delphi wr
binarytree
- 数据结构之二叉树，包含二叉树的建立，遍历和打印。-no
binarytree
- 二叉树的递归遍历算法 “二叉链表”的类模板，数据结构和算法必备学习程序。-Recursive binary tree traversal algorithm " binary list," class templates, data structures and algorithms necessary learning process.
2
- 根据二叉树的抽象数据类型的定义，使用二叉链表实现一个二叉树。 二叉树的基本功能： 1、二叉树的建立 2、前序遍历二叉树 3、中序遍历二叉树 4、后序遍历二叉树 5、按层序遍历二叉树 6、求二叉树的深度 7、求指定结点到根的路径 8、二叉树的销毁 9、其他：自定义操作-According to a binary tree definition of abstract data types, use two forks to achieve a binary
2cs
- 用队列实现二叉树的层次遍历，欢迎大家分享-To achieve the level of binary tree using a queue traversal, welcome to share
Tree_Frame
- 掌握二叉树的创建、遍历的方法。 利用二叉树的按层遍历序列创建二叉树，然后实现二叉树的前序、中序和后序遍历。-Master binary tree creation, traversal methods. The use of binary tree traversal sequences by layer to create a binary tree, and then to achieve binary tree preorder, inorder and postorder trave
fengmanshu
- 丰满树操作: 用顺序存储结构实现； 结点形式：下标，元素值； 功能：查找结点，结点的中序前驱，中序后继，中序遍历，插入结点，删除结点 -Fullness of the tree operations: storage structure in order to achieve junction forms: The next standard, element values function: to find nodes, nodes in the precursor seq
zhubianli
- 实现树的创建算法，创建一个至少包含3层，8个结点的二叉树，并对此树实现先中后序的递归遍历算法。输出三种遍历结果。再实现一个叶子结点查找算法，判断一个给定的数值是否在此树中作为叶子结点。-To achieve the creation of the tree algorithm, to create at least a three-layer, 8 nodes of a binary tree, and after this tree in order to achieve the first