搜索资源列表
ch
- 堆积（heap）是树结构的第三种型态。堆积是一棵二元树，其左右子树节点的值均较其父母节点的值小。堆积的根节点值保证是该树最大值。这中堆绩称为最大堆绩。堆积的子树可摆在左边当左子树，也可摆在右边当右子树，因此左右子树俱有相同的性质。-Heap (heap) are the third type of tree structure. Accumulation is a binary tree, its about the value of subtree nodes than those of th
red
- n computer science, an AVL tree is a self-balancing binary search tree, and it was the first such data structure to be invented.[1] In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by
bitree
- 构造一棵二叉树、释放二叉链表中各结点的存储空间、获取指向二叉树根结点的指针、前序遍历二叉树、中序遍历二叉树、后序遍历二叉树等的编程-Construct a binary tree, the release of storage space for each node in the binary list, access points to the binary tree root pointer, before traversing Binary inorder binary tree trav
Binary-tree
- 课程设计数据结构二叉树的遍历的C++语言的实现方法-Binary tree data structure traversal method
Binary-usage-reports
- 二叉树使用报告，初学者学习数据结构二叉树部分时时通过对一些简单小问题的思考熟悉二叉树-Binary usage reports, for beginners to learn some binary tree data structure often small problems through some simple binary thinking familiar
binary-search-trees-java-demo-master
- Binary Search Tree Java based demonstration on Canvas using AJAX for communication between browser and server