Binary search tree: Difference between revisions

Content deleted Content added
m Deletion: idea due to Hibbard
Calzakk (talk | contribs)
Use BST-Successor in BST-Delete
Line 184:
5 Shift-Nodes(BST, D, D.left)
6 '''else'''
7 E := TreeBST-Successor(D)
8 '''if''' E.parent ≠ D '''then'''
9 Shift-Nodes(BST, E, E.right)