Explain AVL tree with example. Also, explain balancing algorithm for this tree.
Marks: 10Chapter: Unit 8: Trees and Graphs (8 Hrs.)
Chapter Study
Bsc CSIT Semester 3 – Data Structure and Algorithms – Unit 8: Trees and Graphs (8 Hrs.)
Comprehensive questions and detailed answers for Unit 8: Trees and Graphs (8 Hrs.). Perfect for exam preparation and concept clarity.
12
Questions
85
Marks
Explain AVL tree with example. Also, explain balancing algorithm for this tree.
HardTHEORY10 marks2080(TU Final)
Write Dijkstra’s algorithm to find shortest path between any two vertices of a graph.
MediumTHEORY5 marks2080(TU Final)
What is AVL tree? How heap differ from tree? Construct an AVL tree for data 24,12,8,15,35,30,57,40,45 and 78.
HardTHEORY10 marks2081(TU Final)
What is the application of spanning tree? Draw a MST of a graph containing any 8 vertices and 11 edges with arbitrary edge costs.
MediumTHEORY5 marks2081(TU Final)
Write short notes on:
a. Breadth First traversal of graph
b. TOH
MediumTHEORY5 marks2081(TU Final)
Why do we need to balance the binary search tree? Justify with an example. Create an AVL tree from the data 24, 12, 8, 15, 35, 30, 57, 40, 45, 78.
HardTHEORY10 marks2079(TU Final)
Find the MST of following graph using Prim’s algorithm.
MediumTHEORY5 marks2079(TU Final)
Write short noes on:
a. Priority Queue
b. Breadth First traversal of a graph
MediumTHEORY5 marks2079(TU Final)
What is binary search tree? Write a program to implement insertion and deletion algorithms in binary search tree.
HardTHEORY10 marks2078(TU Final)
What is graph traversal? Explain.
MediumTHEORY5 marks2078(TU Final)
What is shortest path? Explain Dijkstra algorithm for finding shortest path using suitable example.
HardTHEORY10 marks2077(TU Final)
What is minimum spanning tree? Explain
MediumTHEORY5 marks2077(TU Final)
Showing 12 questions
Sample Questions
Write Dijkstra’s algorithm to find shortest path between any two vertices of a graph.
Marks: 5Chapter: Unit 8: Trees and Graphs (8 Hrs.)
What is AVL tree? How heap differ from tree? Construct an AVL tree for data 24,12,8,15,35,30,57,40,45 and 78.
Marks: 10Chapter: Unit 8: Trees and Graphs (8 Hrs.)
What is the application of spanning tree? Draw a MST of a graph containing any 8 vertices and 11 edges with arbitrary edge costs.
Marks: 5Chapter: Unit 8: Trees and Graphs (8 Hrs.)
Write short notes on: a. Breadth First traversal of graph b. TOH
Marks: 5Chapter: Unit 8: Trees and Graphs (8 Hrs.)
And more questions available on this page.