Ask
Login
0
18kviews
Define Binary Search Tree. Write algorithm to implement insertion and deletion operation.
written 9.2 years ago by gravatar for teamques10 teamques10 ★ 70k •   modified 6.4 years ago
data structures and algorithms
ADD COMMENT EDIT
1 Answer
0
340views
written 9.2 years ago by gravatar for teamques10 teamques10 ★ 70k

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.

ADD COMMENT EDIT
Please log in to add an answer.