搜索资源列表
RBTreeAndBinary_Search_Tree
- 实现红黑树、二叉搜索树相关算法:插入(红黑树涉及树的调整:左旋、右旋等),删除,搜索(指定Key值节点)。 另外,红黑树实现计算树黑高的算法。 -To achieve red-black tree, binary search tree related algorithms: insertion (red-black tree involves the adjustment of the tree: L, D, etc.), delete, search (Key value of t
sebinarytree
- 主要实现的功能是二叉搜索树的实现,程序比较简单,但是还行-The function of the program is give your idea of the search binary tree
AVLtree
- 二叉搜索树的avl树问题,创建avl树及有关的问题-Binary search tree avl tree problem, create avl trees and related problems
Binarysearch
- 二叉搜索树的初建及有关问题binary search tree -Binary search tree and the problem was first built binary search tree
Translationcircuitconnectionproblems
- 二叉搜索树中的电路连线问题 Binary search tree -Binary search tree in the circuit connection problems Binary search tree
Translationpackingproblem
- 二叉搜索树中的装箱问题Binary search tr-Binary search tree packing problem Binary search tree
Phoneboook
- 在很多实际应用中,动态索引结构在文件创建或初始装入记录时生成,在系统运行过程中插入或删除记录时,为了保持较好的检索性能,索引结构本身将随之发生改变。本程序采用二叉搜索树结构,设计并实现一个手机电话薄软件。-In many practical applications, the dynamic index structure in the file record created or generated when the initial load, the system is running w
EX3
- 链表实现的普通二叉搜索树,支持插入、搜索、删除功能。-Linked list implementation ordinary binary search tree, support insert, search, delete function.
SearchTree
- 二叉搜索树,实现二叉搜索树的插入、删除、查找、周游功能-Binary search tree, binary search tree insert, delete, find, traveling function
ConvertBinarySearchTree
- 该C++源码可将二叉搜索树转换为一个已排序的双向链表。-Convert a BinarySearchTree to a sorted double linkedlist.
binurary-tree
- 一个建立二叉搜索树的简单小程序,供初学者参考一下-A binary search tree created a simple applet
Binary_Tree
- 数算的二叉树的POJ作业,分别有:二叉树1_二叉树的操作;二叉树2_文本二叉树;二叉树3_由中根序列和后根序列重建二叉树;二叉树4_表达式.表达式树.表达式求值;二叉树5_Huffman编码树;二叉树6_二叉搜索树;二叉树7_实现堆结构-Count of the binary tree POJ jobs
AVLTree
- AVL 树是平衡二叉搜索树,所以首先 必须满足搜索树,即l_child值<parent值<=r_child值。这个在前面已经实现了。插入和删除不停的递归就可以。-Two AVL tree is balanced binary search trees, so we must first meet the search tree, l_child value and <parent value of <=r_child value. The in front has bee
Btree
- 二叉搜索树代码实现,数据结构,包含建立,插入,搜索,删除-Binary search tree code, data structures, including the creation, insert, search, delete
BINARY-SEARCH-TREE.cpp
- 二叉搜索树在动态查表中有特别的用处,一个无序序列可以通过构造一棵二叉搜索树变成一个有序序列,构造树的过程即为对无序序列进行排序的过程。每次插入的新的结点都是二叉搜索树上新的叶子结点,在进行插入操作时,不必移动其它结点,只需改动某个结点的指针,由空变为非空即可。 这里,我们想探究二叉树的建立和序列输出。-Binary search tree has a dynamic look-up table in particular the usefulness of an unordered
become-linked-list
- 将二叉搜索树变为双向链表,可直接编译通过-The two binary search tree into two-way linked list, compiled by
BST
- 二叉搜索树,使用c++开发语言实现,开发平台为visual studio 2012-search tree, use c++
After_BinaryTree
- 输入一个整数数组,判断该数组是不是某二叉搜索树的后序遍历。 -Two binary search tree traversal sequence
二叉树遍历
- 二叉树遍历(Traversal)是指沿着某条搜索路线,依次对树中每个结点均做一次且仅做一次访问。访问结点所做的操作依赖于具体的应用问 题。 遍历是二叉树上最重要的运算之一,是二叉树上进行其它运算之基础。(Two tree traversal (Traversal) refers to a search line, in turn, each node in the tree to do once, and only a visit. The operation of the access nod
OptimalBinarySearchTree
- 实现并优化二叉搜索树,在vs2015上运行,文件包含整个项目(Implement and optimize binary search tree, run on vs2015, file contains the whole project.)