搜索资源列表
arc
- 运用二叉树求代数表达式的值，将代数表达式的每个符号用二叉树结点表示，遍历图的每一结点，按结点值得不同采用不同运算方式-Solving algebraic expressions binary tree
Untitled1
- 二叉树的基本操作（有界面） 包括各项遍历 主要涵盖递归与非递归-binary tree the basic operating
main
- 树的前序中序后序遍历的递归和非递归算法。-Preamble in sequence after preorder tree recursive and non-recursive algorithm.
Binary-tree-in-the-establishment
- 二叉树的建立 中序遍历二叉树 把二叉树转换成双向链表-Binary tree in the establishment of traversing Binary conversion to binary tree into a doubly linked list
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.
Binary-arithmetic-operations
- 实现二叉树的常用操作算法：包括二叉树的建立、遍历、求高度、线索化等操作-Binary tree algorithm to achieve common actions include: the establishment of tree, traversal, seeking height, threaded and other operations
shu
- 数据结构C语言版 二叉树的三种遍历 简单易实现-C-language version of the binary tree data structure traversal is simple and easy to achieve three
er-cha-shu
- 一个二叉树遍历的例子，初学C++的人可以下载学习一下。-A binary tree traversal example, beginner C++ people can download to learn about.
kill
- Linux内核编程，设计某一个函数，输入为Linux系统某一个进程的进程号（PID），函数将杀死该进程的所有子孙。Linux内核进程家族为多叉树数据结构，以祖先进程为根节点。对于这种数据结构，后序遍历树的每个节点，在遍历同时删除节点，就可以删除整个进程树。-Linux kernel programming, design one function, one input for a Linux system process ID (PID), the function will kill all
8p
- 数据结构的树结构 用来树的查找 遍历 等算法功能！-Tree data structure for tree traversal algorithms search function!
avl_tree
- C语言实现的AVL树，实现了插入、删除、查找、rank、非递归前序、中序、后序遍历-AVL Tree in C
InBiThrTree
- 数据结构课程设计【中序线索二叉树】的相关算法。包括中序线索化算法、中序遍历线索二叉树、求父亲结点算法。-[Including] inorder threaded binary algorithm in order clues, clues to binary tree traversal, seeking parent node algorithm and destructors
Non-recursive-traversal-of-a-tree
- 树的非递归遍历中序，C++ 数据结构，非常适合初学者-Non recursive traversal of the tree in the order, C++ data structure, very suitable for beginners