Question

In binary search tree , n=nodes, h=height of tree. what's complexity? 1. o(h) 2. o(n*h) 3. o(nlogn) 4. o(n*n) 5. none

Answer 1

Correct answer is :complexity is (3) : o(nlogn):

By extending linked data structure conceptwhich consists of nodes with multiple self-referenced zone we can achieve a Binary Search Tree or BST,which is made of nodes.

Here, each node has two reference frames namely a "left" reference, a "right" reference, and also contains a data element.

The topmost node of the tree is called the root of the tree.