Binary search trees

Can anyone describe in plain language (no code needed), an iterative algorithm for locating an element stored in a binary search tree? I can only think of it recursively and am having trouble thinking of it in an iterative way.
Check node data, if its greater then the data your searching for go left, if its less go right and if its equal you found the node.
Topic archived. No new replies allowed.