CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - balance tree
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
Button control
ComboBox
EditBox
TreeView
Static control
PropertySheet
RichEdit
ListView/ListBox
Menu control
ToolBar
StatusBar
Dialog_Window
Other
Tab Control
Search - balance tree - List
[
Other
]
genBST
DL : 0
通用二叉搜索树,包含的算法有:输出广度优先遍历、前序、中序、后序遍历结果,按树的形状打印树,统计总节点数,统计叶子节点数,统计右节点数,计算树的高度,删除所有叶子节点,插入节点,查找节点,删除节点,由前序遍历结果和中序遍历结果生成树,由后序遍历结果和中序遍历结果生成树,检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth - first traversal, the former sequence, sequence, after the preorder, the shape of the tree by tree print, the total number of nodes statistics, statistics leaf nodes, the nodes to the right statistics to calculate tree height, remove all leaf nodes, insert nodes, the nodes you delete nodes from the former preorder results and the results of Spanning Tree preorder, After the preorder from the results and the results preorder spanning tree, check whether the tree balanced and complete balance.
Date
: 2008-10-13
Size
: 16.03kb
User
:
雷剑
[
Other
]
BalanceTree
DL : 0
平衡树,包括平衡树的创建,按照树的形状打印-tree balance, including the balance of the tree is created, in accordance with the shape of the tree Print
Date
: 2008-10-13
Size
: 14.01kb
User
:
雷剑
[
Other
]
E64_0230
DL : 0
平衡二叉树操作的演示 一、 需求分析 (1) 利用平衡二叉树实现动态查找表。实现查找,插入和删除三种基本功能。 (2) 初始,平衡二叉树为空树,操作界面给出查找,插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时,显示更新的平衡二叉树。 (3) 重点在于对删除算法的实现。假设要删除的关键字为X的结点,若X不在叶子结点上,则用左子树中的最大值或者右子树中的最小值取代X。如此反复,直到删除动作传递到某个叶子结点,删除叶子结点时,若要进行平衡变换,可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Insert the available balance transform inverse transform.
Date
: 2008-10-13
Size
: 40.51kb
User
:
苏言暖
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.