Give a basic algorithm for searching a binary search tree.
4 years ago
Data Structure and Algorithm
1.if the tree is empty, then the target is not in the tree, end search
2. if the tree is not empty, the target is in the tree
3. check if the target is in the root item
4. if a target is not in the root item, check if a target is smaller than the root’s value
5. if a target is smaller than the root’s value, search the left subtree
6. else, search the right subtree
Sujan Bk
Jan 9, 2022