Binary search tree: Difference between revisions

Content deleted Content added
Takymu (talk | contribs)
m in while loop I placed "do" instead of "then"
Tag: Reverted
Reverted good faith edits by Takymu (talk): Being consistent with other pseudocodes
Tags: Twinkle Undo Reverted
Line 71:
|
Iterative-Tree-Search(x, key)
'''while''' x ≠ NIL '''and''' key ≠ x.key '''dothen'''
'''if''' key < x.key '''then'''
x := x.left