Question

What are the main characteristics of a binary search tree? In your opinion, what advantages does a binary search tree have over a linked list or an array? Assuming you want to create a binary search tree of integers, draw the resulting tree if the integers input were as follows :

25 43 12 20 5 50 30

Answer 1

Binary Search Tree :  Binary search tree is a binary tree in which the keys in the left subtree are smaller than the key in the root and the keys in the right subtree are greater than the key in the root.

• In this no two elements can have same key.
• Left and right subtree are also binary search trees.

Advantages:

• Insertion , deletion and search operation can be performed in logarithmic time complexity
• Elements are stored in an order.For eg. if we need to find elements in increasing order we just need in-order traversal(L ->N->R).
• We can perform range queries like if we want to find numbers between two numbers present in the tree.

Disadvantages:

• The shape depends on the order of insetion and it can be degenerated.
• Implementation of balanced binary tree is required for logarithmic time complexity.

Tree for given input 25,43,12,20,5,50,30

wertu2 Suau u324く on th. Jg4.uda! 12 12. ML dlu

Please rate if you liked the answer, would be glad if it helped:)