Search - Binary Tree

Search - Binary Tree - List

[MiddleWare] d_stree DL : 0: 自定义的二叉搜索树的头文件-Since the definition of binary search tree of the header files
Date : 2025-12-19 Size : 5kb User :
[MiddleWare] BLinkTree11 DL : 0: 二叉树建立，建立文件库，这有利于信息查找-Binary tree to establish, document library, which is conducive to information discovery
Date : 2025-12-19 Size : 305kb User : 2010
[MiddleWare] dan DL : 0: // 堆排序 // 初始调用BuildMaxHeap将a[1..size]变成最大堆 // 因为数组最大元素在a[1]，则可以通过将a[1]与a[size]互换达到正确位置 // 现在新的根元素破坏了最大堆的性质，所以调用MaxHeapify调整， // 使a[1..size-1]成为最大堆，a[1]又是a[1..size-1]中的最大元素， // 将a[1]与a[size-1]互换达到正确位置。 // 反复调用Heapify，使整个数组成从小到大排序。 // 注意：交换只是破坏了以a[1]为根的二叉树最大堆性质，它的左右子二叉树还是具备最大堆性质。 // 这也是为何在BuildMaxHeap时需要遍历size/2到1的结点才能构成最大堆，而这里只需要堆化a[1]即可。-//Heap sort// initial call BuildMaxHeap will become the largest heap a [1 .. size]// the array largest element in a [1], then by a [1] and a [size] interchangeable reach correct position// new root element destroyed maximum heap nature so call MaxHeapify adjusted,// a [1 .. size-1] the maximum heap, a [1] a [1 .. size- The largest element 1],// a [1] with a [size-1] interchangeable achieve the correct position.// Repeatedly call Heapify, so that the entire number of small to large.// Note: The to exchange just destroyed a [1] is the root of the binary tree maximum heap nature, its left and right sub-binary tree or with maximum heap nature.// This is why BuildMaxHeap when you need to traverse the size/2 to 1 node in order to constitute maximum heap, only need to heap of a [1] can be.
Date : 2025-12-19 Size : 1kb User : 李子健
[MiddleWare] stacknode DL : 0: 栈这种数据结构是一个工具性的数据结构，通常被其它复杂数据结构所使用。比如实现二叉树的遍历的非递归算法。下面就用C++模板实现栈数据结构的一个较完整代码！在书本《数据结构（C语言版）--严慰明》提到栈可以用数组，也可以用链表实现，这里只用链表实现这一数据结构。-This data structure is a stack instrumental data structure is often used for other complex data structures. Such as a binary tree traversal non-recursive algorithms. Here s a C++ template stack data structure to achieve a more complete code! In the book "data structure (C language version)- Yan Weiming," said the stack can use arrays, linked lists can also be used to achieve, here only achieve this with a linked list data structure.
Date : 2025-12-19 Size : 2kb User : liyuyu