Ask
Login
0
50kviews
Construct Binary search tree for the following element. 47,12,75,88,90,73,57,1,85,50,62
written 2.7 years ago by gravatar for CoBB CoBB • 50 modified 2.7 years ago by gravatar for Krishna_Agrawal Krishna_Agrawal • 2.7k
data structures and algorithms
ADD COMMENT EDIT
1 Answer
4
9.0kviews
written 2.7 years ago by gravatar for Krishna_Agrawal Krishna_Agrawal • 2.7k


Binary Search Tree (BST) for the following sequence of numbers-

47, 12, 75, 88, 90, 73, 57, 1, 85, 50, 62

Always consider the first element as the root node. Consider the given elements and insert them in the BST one by one.


Step 1. Insert 47

enter image description here

Step 2. Insert 12

enter image description here

Step 3. Insert 75

enter image description here

Step 4. Insert 88

enter image description here

Step 5. Insert 90

enter image description here

Step 6. Insert 73

enter image description here

Step 7. Insert 57

enter image description here

Step 8. Insert 1

enter image description here

Step 9. Insert 85

enter image description here

Step 10. Insert 50

enter image description here

Step 11. Insert 62

enter image description here

This is the required Binary Seach Tree (BST).
ADD COMMENT EDIT
Please log in to add an answer.