Job Saarnee

Unit 5 Most Frequently Asked Question of Data Structure

Q 1: Write a C program to
implement binary tree insertion, deletion
with
example.

Q 2: Write a C program to
implement various traversing techniques of
binary tree with neat example.

Q 3: Explain binary search tree
and its operations. Make a binary search
tree for the following sequence of numbers, show all steps: 45,32,90,34,72,24,30,66,11,50,10.

Q 5: Define binary search tree.
Create BST for the following data,   show
all steps: 20,10,25,5,22,30,3,14,13.

Q 6: Define tree, binary tree,
complete binary tree and full binary tree.
Write algorithm or function to obtain traversals of a binary tree in pre-order, postorder and inorder.

Q 7: Construct a binary tree for
the following:

Inorder:
Q,B,K,C,F,A,G,P,E,D,H,R

Preorder:
G,B,Q,A,C,K,F,P,D,E,R,H

Find
the postorder of the tree.

Q 8: Construct a binary tree for
the following:

Inorder:
D,B,H,E,A,I,F,J,C,G

Preorder:
A,B,D,E,H,C,F,I,J,G

Q 9: Construct a binary tree for
the following:

Inorder:
B,C,A,E,G,D,H,F,I,J

Preorder:
A,B,C,D,E,F,G,H,I,J

Q 10: Write procedure to delete an
element in a binary search tree where node does not have two children.

Q 11: Write procedure to delete an
element in a binary search tree where node
has two children.

Q 12: What is a threaded binary
tree ? Explain the advantages of using
a threaded binary tree.

Q 13: What is Huffman tree ?
Create a Huffman tree with following numbers
: 24,55,13,67,88,36,17,61,24,76.

Q 14: Explain Huffman algorithm.
Construct Huffman tree for
MAHARASHTRA
with its optimal code.

Q 15: Define AVL trees. Explain
its rotation operations with   example.Construct
an AVL tree with the values 10 to 1      numbers
into an initially empty tree.

Q 16: Consider the following AVL
tree and insert 2,12,7,and 10 as new
node. Show proper rotation to maintain the tree as AVL.

Q 17: What is height balanced tree
? Why height balancing of tree   is
required ? Create an AVL tree for the following elements:     a,z,b,y,c,x,d,w,e,v,f.

Q 18: Construct a height balanced
binary search tree by performing following
operations :

step1:
Insert: 19,16,21,11,17,25,6,13

step2:
Insert 3

step3:
Delete 16

Q 19: Describe all rotations in
AVL tree. Construct AVL tree from
the
following nodes: B,C,G,E,F,D,A.

Q 20: Define B tree. What are the
applications of B tree ? Draw a B-tree
of order 4 by inserting following keys:

a,b,c,d,e,f,g,,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z

Q 21: Construct a B-tree of order 5
by inserting following elements:
3,14,7,1,8,5,11,13,6,23,12,20,26,4,16,18,,24,25,19  also delete elements 6,23 and 3 from the constructed tree.

Q 22: Construct a B-tree of order
3 by inserting following elements:
10,20,30,40,50,60,70,80,90.

Q 23: Compare and construct the
difference between B+ tree index files
and B-tree index files with an example.
For all study material click here

Shopping Cart