0
18kviews
Define Binary Search Tree. Write algorithm to implement insertion and deletion operation.
1 Answer
0
340views

Definition: A binary tree is said to be a binary search tree if it is the empty tree or

  1. if there is a left-child, then the data in the left-child is less than the data in the root,
  2. if there is a right-child, then the data in the right-child is …

Create a free account to keep reading this post.

and 4 others joined a min ago.

Please log in to add an answer.