Register

Recent questions tagged binary-search-tree

3 votes
3 answers
121
CORMEN
What is the asymptotic performance of TREE-INSERT when used to insert n items with identical keys into an initially empty binary search tree?
What is the asymptotic performance of TREE-INSERT when used to insert nitems with identical keys into an initially empty binary search tree?
User Avatar
2 votes
2 answers
122
self doutbt
How to Construct Full Binary Tree from given preorder and postorder? Thank you.
How to Construct Full Binary Tree from given preorder and postorder?Thank you.
User Avatar
3 votes
1 answer
123
AVL Tree
Let T be a binary search tree with n nodes and Sn be the average number of comparisons required for successful search and Un be the average number of comparison required for an unsuccessful search. Then what is the relation between Sn, Un and n
Let T be a binary search tree with n nodes and Sn be the average number of comparisons required for successful search and Un be the average number of comparison required ...
User Avatar
0 votes
1 answer
127
Binary Tree
Can a binary tree or BST can be constructed with dynamic programming? Can it be constructed through greedy method? Plz give some algorithm and explain
Can a binary tree or BST can be constructed with dynamic programming? Can it be constructed through greedy method?Plz give some algorithm and explain
User Avatar
1 votes
2 answers
129
Gradup topicwise question
Consider the vales of bst $11,22,33,44,55,66,77,88$. Which of the following is a valid sequence of preorder traversal? $55,33,11,22,44,77,66,88$ $55,33,22,44,11,66,77,88$ $55,33,11,44,22,66,77,88$ $55,33,11,44,22,66,77,88$ Given answer is option A But how?
Consider the vales of bst $11,22,33,44,55,66,77,88$.Which of the following is a valid sequence of preorder traversal?$55,33,11,22,44,77,66,88$$55,33,22,44,11,66,77,88$$55...
User Avatar
1 votes
1 answer
131
self doubt
give an o(n) algorithm to check whether the given binary tree is bst or not
give an o(n) algorithm to check whether the given binary tree is bst or not
User Avatar
1 votes
4 answers
133
trees
Given a preorder, postorder and inorder traversal of a tree, is it always possible to obtain a tree that satisfies each of the three conditions? Or is it possible to not obtain a tree at all?
Given a preorder, postorder and inorder traversal of a tree, is it always possible to obtain a tree that satisfies each of the three conditions? Or is it possible to not ...
User Avatar
1 votes
1 answer
137
BST01
In deleting the root element of a BST, we have to replace root with _________ a)Inorder successor b)Inorder predecessor c)Both a and b
In deleting the root element of a BST, we have to replace root with _________a)Inorder successorb)Inorder predecessorc)Both a and b
User Avatar
5 votes
1 answer
138
Balanced binary search tree
A balanced binary search tree of n nodes,the number of steps needed to find and remove the 9th largest element in the worst case? (Please mention the algorithm followed)
A balanced binary search tree of n nodes,the number of steps needed to find and remove the 9th largest element in the worst case?(Please mention the algorithm followed)
User Avatar
4 votes
0 answers
139
AVL tree deletion
When node 50 will be deleted, what will be resultant AVL tree?
When node 50 will be deleted, what will be resultant AVL tree?
User Avatar
1 votes
0 answers
140
#of BST
Find number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having 6 as root and height of 4 ? please explain in detail ...
Find number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having 6 as root and height of 4 ?please explain in detail ...
User Avatar
1 votes
1 answer
141
DS BINARY TREE
Consider a binary tree T that has 100 leaf nodes. Then the number of INTERNAL nodes in T that have exactly two children are ______.
Consider a binary tree T that has 100 leaf nodes. Then the number of INTERNAL nodes in T that have exactly two children are ______.
User Avatar
1 votes
1 answer
142
Self doubt B tree B+tree
To insert key into level L B/B+ tree maximum new nodes require to create?? And how?
To insert key into level L B/B+ tree maximum new nodes require to create?? And how?
User Avatar
0 votes
1 answer
147
Zeal Test Series 2018: Programming & DS - Binary Search Trees
Given an initially empty Binary search tree how many different order of insertion order A,B,C,D,E,F,G that returns minimum height tree?
Given an initially empty Binary search tree how many different order of insertion order A,B,C,D,E,F,G that returns minimum height tree?
User Avatar
1 votes
1 answer
149
ace test
The number of ways we can insert 11, 12, 13, 14, 15, 16, 17 in empty binary search tree such that resulting tree has the height of 6 = ___________ [height of a tree with single node is 0.]
The number of ways we can insert 11, 12, 13, 14, 15, 16, 17 in empty binary search tree such that resulting tree has the height of 6 = ___________ [height of a tree with ...
User Avatar
4 votes
4 answers
150
Number of binary search trees
How many different binary search trees can be constructed using six distinct keys? 256 128 132 264
How many different binary search trees can be constructed using six distinct keys? 256 128 132 264
User Avatar
Page: