Binary search tree: Difference between revisions

Content deleted Content added
Reverted good faith edits by Takymu (talk): Being consistent with other pseudocodes
Tags: Twinkle Undo Reverted
m Undid revision 1179820761 by WikiLinuz (talk) Sorry, if has then, but while has do.
Line 71:
|
Iterative-Tree-Search(x, key)
'''while''' x ≠ NIL '''and''' key ≠ x.key '''thendo'''
'''if''' key < x.key '''then'''
x := x.left