Question

of binary search tree starts by
visiting the
the current node
then its left
then its right child
1
child​

Answer 1

BST:- Binary search tree

______________________

• the left sub tree of a node has a key less than or equal to parent node key.
• the right sub tree of a node has greater key than it's parent node key .

______________________