搜索资源列表
tokensort
- 桶排序二叉搜索树，参考参考吧，没啥意思的-barrels Binary Search Trees, reference reference it, lacks meaning.
ThBSTree
- 线索二叉搜索树结点的插入删除以及树的打印。-clues two forks search tree node of the tree to insert, delete and print.
shuju
- 数据结构学习用到的一些程序！！里面有二叉树相关的几个，有深度，广度搜索，各种排序等！-data structure used to study some of the procedures. ! There are several related to the binary tree, the depth, breadth search, various ranking!
genBST
- 通用二叉搜索树，包含的算法有：输出广度优先遍历、前序、中序、后序遍历结果，按树的形状打印树，统计总节点数，统计叶子节点数，统计右节点数，计算树的高度，删除所有叶子节点，插入节点，查找节点，删除节点，由前序遍历结果和中序遍历结果生成树，由后序遍历结果和中序遍历结果生成树，检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth - first traversal, the former
Graph2
- 二叉树的遍历、线索化、遍历线索化二叉树等算法；深度搜索优先、广度搜索优先算法， 最小生成树、最短路算法。
wxc_BSTree
- 数据结构算法（C++实现）二叉搜索树的类定义和实现
判断二叉搜索树
- 判断一棵二叉树是否为二叉搜索树的算法-judge whether a binary tree search for the binary tree algorithm
AVL树实现
- 纯C实现的AVL树，Demo是MFC的。非递归的遍历，完全支持添加、删除和搜索节点。设计灵活，容易扩展。以下是API struct tagAvlTree; typedef struct tagAvlTree AvlTree; struct tagAvlNode; typedef struct tagAvlNode AvlNode; struct tagAvlNode { AvlNode *left; AvlNode *right; int32_t height;
BStreeLJH
- MFC实现二叉搜索树，输出先序，中序和后序遍历结果。-MFC binary search tree, output preorder, inorder and postorder traversal results.
BinaryTreeStudio
- 搜索二叉树的使用与编程，从初步开始到精通-Search the use of binary tree and programming, starting the preliminary to master
Completed-BinaryTree
- 遍历(Traversal)沿着某条搜索路线，依次对树中每个结点均做一次且仅做一次访问二叉树的实现逻辑和流程-Traversal (Traversal) along a strip search route, turn on each node of the tree were done once and only once to access binary logic and processes to achieve
omtimaldhsqgn
- 算法设计的动态规划中的最优二叉搜索树问题,是用VC＋＋编写的-Algorithm design of dynamic programming problem of the optimal binary search tree is written in vc++
ctopeu
- 算法设计的动态规划中的最优二叉搜索树问题,是用VC＋＋编写的()
fuwctizoal
- 算法设计的动态规划中的最优二叉搜索树问题,是用VC＋＋编写的()