# Binary search tree

293 views

in DS
0
Answer is B but dunno how...

1 vote

selected
0
thnx for answering... can you explain how do we get the relation between S(n) and I(n) in equation 1.1
0
See  the description below the figure and u'll get ur answer
0

@ Did took me some time, but understood finally :D

Can you cite the source of these pages?

## Related questions

1 vote
1
359 views
AVL tree is created by inserting the keys 2, 6, 1, 5, 3, 4, 7 in the given order (Assume the tree is initially empty). Then the level order traversals of the tree would be. 2, 1, 3, 5, 4, 6, 7 3, 2, 5, 1, 6, 4, 7 2, 1, 3, 4, 5 ... even after knowing all the concepts. After 2 or 3 rotations I get stuck trying to figure out which way to rotate. Please help me with the proper steps in this question.
Consider the following routine bool do(struct node *root) { if(!root) return true; else if(( root ---> left != NULL && root ---> data < root ---> left---> data) ||(root-->right != NULL && root ---> data > root ----> right ----> data)) return false; else return (do( ... do(root---> right)); } What does they do() check whether a given tree is: $A)$ Max heap $B)$ Min Heap $C)$BST $D)$ Binary Tree
Consider a binary search tree for the following sequence of nodes $a,b,g,f,c,e,d$ What is the resultant tree if splaying is done at $'d'.$