Question Bank

Theory Question Bank on Unit-V & Unit-VI

    1.  Construct Binary Search Tree from following elements

5,2,8,4,1,9,7.

Also show preorder, postorder and inorder traversal for the same

2. Explain with suitable example how binary tree can be represented using:

a.       Linked list

b.      Array

3.   Write a program in C to construct and perform tree traversals on binary search tree using lined list.

4. Construct Binary Search Tree from following elements

MAR, MAY, NOV, AUG, APR,  JAN, DEC,  JUL,  FEB,  JUN,  OCT,  SEPT.

5. What do you mean by adjacency matrix and adjacency list? Give the by adjacency matrix and adjacency list of the given graph?

6.  Define DFS and BFS of a graph with example?
7.Find out minimum spanning tree of the following graph  using

a.       Prim’s algorithm

b.      Kruskal’s Algorithm

8. Find shortest path using Dijkstra’s  algorithm for the given graph

  9. Write algorithm to print a given graph in BFS. Give its time complexity

   

  10. Explain different types of trees in data structure?

11. Convert the following tree to Binary Tree.

 

 12. Write short note on

a.       Threaded Binary Tree

b.      Binary Search tree

c.       DFS

d.      BFS