Welcome![Sign In][Sign Up]
Location:
Search - programe for binary tree insertion and deletion us

Search list

[OtherE64_0230

Description: 平衡二叉树操作的演示 一、 需求分析 (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.
Platform: | Size: 40960 | Author: 苏言暖 | Hits:

CodeBus www.codebus.net