搜索资源列表
bst
- 排序二叉树类简单实现，采用引用类型代码很简洁，但是很巧妙。-btree code
bst
- 实现了二叉查找树的各种功能, 如查找\删除\插入等,结构比较清晰-The various functions of the binary search tree, such as Find \ delete \ insertion, the structure is relatively clear
binary_tree
- 二叉树的建立和遍历，包含非递归。源码中自己定义栈和队列，没有用到stl。还有AVL，BST，线索二叉树，还有堆。自己看吧-something about binary tree
BST
- BS树的，创建，插入，删除查找功能inorder排序-For question 2, I give the program a list of number which is: 15 45 878 96 253 451 12. At the end of number will be 0 to tell the program the input is end. There is a menu we can chose to insert, delete and find element
chengxu
- 一、约瑟夫循环问题；二、一元多项式的运算；三、逆波兰表达式求值；四、杨辉三角显示；五、四则运算表达式求值；六、BST二叉树-First, Joseph circulation problems Second, one yuan polynomial arithmetic Third, reverse Polish expression evaluation Fourth, Pascal' s Triangle Show five, four arithmetic expressio
Chap06
- 数据结构中的树相关的算法和源代码，包括AVL树、BST树和优先队列等，自己用VC6.0编写的。-Tree data structure algorithms and related source code, including AVL tree, BST trees and priority queues, etc., own VC6.0 prepared.
bst
- 二叉树实现，含遍历，codeblocks调试，C++代码-Binary Tree, including traversal, codeblocks debugging, C++ code
BST
- 二叉搜索树，使用c++开发语言实现，开发平台为visual studio 2012-search tree， use c++
Complete-Binary-Search-Tree
- 网易云课堂-陈越、何钦铭-数据结构-2016春 PTA-04-树6 Complete Binary Search Tree 编译器：python2-Complete Binary Search Tree A Complete Binary Tree (CBT) is a tree that is completely filled, with the possible exception of the bottom level, which is filled left to ri
BST
- 问题描述 利用二叉查找树（BST）实现一个动态查找表。 基本要求 (1) 使用二叉树（BST）来实现。 (2) 二叉树使用链式结构（二叉链表）实现。 (3) 实现BST的构建，查找两个功能。 -The basic requirements(1) using a binary tree (BST).(2) binary tree using the chain structure (binary list).(3) implementation of BST buil
BST
- 使用BST树建立一个城市数据库，可实现插入、删除等操作(Building a city database using the BST tree)
BST二叉树的基本操作
- BST二叉排序树的插入、查询、删除、遍历 （中序遍历 从小到大）(The basic operation of the BST two forked tree.Inserting, querying, deleting, traversing two forked sort trees.)
二叉查找树(Ⅰ)-创建和遍历
- input It is composed of multiple sets of data. Each group of data is composed of two lines. The first line is the number of keywords to be inserted, n (1<=n<=100). The second line is a positive integer separated by a n space, with a value o