Scribd
Upload
4 views

Dsa Unit-4 Question Bank

The document is a question bank for the Data Structures and Algorithms course for B.E. III Semester CSE students at Muffakham Jah College of Engineering & Technology. It includes short answer questions on concepts like AVL trees, binary trees, and heaps, as well as long answer questions requiring the construction and traversal of various tree structures. The questions aim to assess students' understanding of tree properties, traversal techniques, and the implementation of data structures.

Uploaded by

aaa692431m
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Dsa Unit-4 Question Bank

The document is a question bank for the Data Structures and Algorithms course for B.E. III Semester CSE students at Muffakham Jah College of Engineering & Technology. It includes short answer questions on concepts like AVL trees, binary trees, and heaps, as well as long answer questions requiring the construction and traversal of various tree structures. The questions aim to assess students' understanding of tree properties, traversal techniques, and the implementation of data structures.

Uploaded by

aaa692431m
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

MUFFAKHAM JAH COLLEGE OF ENGINEERING & TECHNOLOGY

(SULTAN-UL-ULOOM EDUCATION SOCIETY)


COMPUTER SCIENCE AND ENGINEERING DEPARTMENT

B.E. III SEMESTER CSE (SECTION-B) 2024-25

(Data Structures and Algorithms-PC 301 CS)

QUESTION BANK UNIT-4

SHORT ANSWER QUESTIONS

1) Define : a) level b) degree c) leaf d) depth/height


2) What are the properties of a BST?
3) Define an AVL tree. What is a balance factor?
4) Write about AVL Trees rotation.
5) Define Max heap and Min heap.
6) Differentiate between a Tree and a Binary tree?
7) What are the different traversals techniques?
8) Draw all possible AVL trees of height 3.
9) Construct a Min-heap for {18, 15, 25, 6, 45, and 50}.

LONG ANSWER QUESTIONS

1) What are the different ways to represent a Binary tree?


2) Write the implementations of inorder/postorder/preorder traversal.
3) Construct a binary tree :Inorder: 4 , 5 , 6 ,7 , 8 , 10 , 11 , 12 , 13. Postorder:6 , 5 ,
7 , 4 , 11 , 12 , 10 , 13 , 8 from the given Inorder and Postorder traversal.
4) How do you copy a binary tee? Explain the code with an example.
5) Construct a BST by taking the following elements:
{100,50,200,300,20,150,70,180,120,30}.Traverse the obtained BST in Preorder,
Postorder and Inorder.
6) Insert into BST {3, 6, 9, 1, 4, 2, 10, 12, and 7} and delete the nodes until we have a
complete binary tree of height 2.
7) Construct a BST for the following values: 10, 4, 9, 20, 30, 26, 29, 27 and 25. Delete
the following nodes 4,26,20,10 and show the reconstructing of BST.
8) Explain about single and double rotations in AVL tress with suitable examples.
Illustrate how insertion and deletion are done on an AVL tree.
9) Construct an AVL tree using the following values: 3, 2, 15, 10, 28, 18, 4, 14, 30, 9,
21 and 26.
10) Construct an AVL tree by inserting the following numbers in the order in which
they are given. (Draw figure in each step):17, 25, 19, 23 and 75.
11) Construct AVL tree with the following example: 21, 26, 30,9,4,14,28,18,15,10,23.
12) Define Heap. Construct and explain a heap with suitable example.
13) Construct a Binary Search Tree for the following data and perform in-order,
Preorder and Post-order traversal of the tree:50, 60, 25, 40, 30, 70, 35, 10, 55, 65,
5.

You might also like