A binary search tree arranges its elements in a specific order.
<h3>
What is binary?</h3>
- Image result for binary
- Binary describes a numbering scheme in which there are only two possible values for each digit -- 0 or 1 -- and is the basis for all binary code used in computing systems.
- True, Yes the search algorithm for AVL tree and the binary search tree are same.
- Because in both trees, of a certain a node, the smaller elements reside in the left sub-tree and the larger elements reside in the right sub-tree.
- So while searching an element in the AVL tree we start the search from the root node.
- We compare the element to be searched with the root node.
- if (element < root node), then move in left and compare with it's left child.
- else move in right and compare with it's right child.
- Similarly in next phase move accordingly as in the binary search tree.
- In a Binary search tree, the value of the left node must be less than the value of the parent node, and the value of the right node must be greater than the value of the parent node. This law is applicable recursively to the root's left and right subtrees.
Binary Search Tree Algorithm:
Search (root, item)
if (item = root → data) or (root = NULL)
return root
else if (item < root → data)
return Search(root → left, item)
else
return Search(root → right, item)
END if
Step 2 - END
To learn more about binary refer to:
brainly.com/question/12946457
#SPJ4
