Ads&a Mid-1 QB
Ads&a Mid-1 QB
Ads&a Mid-1 QB
UNIT – II
1. Write the algorithm to:
(a) Search an element in binary search tree.
(b) Delete an element from binary search tree.
2. (a) What are the advantages of binary search tree over binary tree?
(b) Give the algorithm and explain insertion into B tree.
REGULATION: R-20
3. (a) What is an AVL tree and what are its advantages over binary search tree?
(b) Explain the case where the root is split and a new root node is added to a
B-Tree with an example.
4. (a) Explain about Binary search tree and their searching operation with an
example.
(b) Build a Binary Search Tree for the following elements.
{45, 15, 79, 90, 10, 55, 12, 20, 50}.
5. Construct an AVL Tree with the following keys:
{45,60,78,90,34,23,79,88,102,120,40}, after constructing delete the following
element 34,88,60 from the AVL tree.
6. Construct a B-tree of order of order 3 by inserting numbers from 1 to 10 and
also explain about Insertion operation in B-tree.
UNIT – II
REGULATION: R-20
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies: