Binary search tree: remove node: Difference between revisions
Jump to navigation
Jump to search
(Created page with "Category:Binary Search Tree == General Information == == Abstract View == == Induction Basis == == Induction Step == == Complexity ==") |
|||
| Line 2: | Line 2: | ||
== General Information == | == General Information == | ||
'''Algorithmic problem:''' See the remark clause of [[Binary Search Tree]]; pointer '''p''' as defined there is the input. | |||
'''Prerequisites:''' <math>p.left \neq void</math> | |||
'''Type of algorithm:''' loop | |||
'''Auxiliary data:''' A pointer <math>p'</math> of type "pointer to a binary search tree node". | |||
== Abstract View == | == Abstract View == | ||
Revision as of 21:23, 25 September 2014
General Information
Algorithmic problem: See the remark clause of Binary Search Tree; pointer p as defined there is the input.
Prerequisites: [math]\displaystyle{ p.left \neq void }[/math]
Type of algorithm: loop
Auxiliary data: A pointer [math]\displaystyle{ p' }[/math] of type "pointer to a binary search tree node".