Professional Documents
Culture Documents
(a)
(b)
(c)
(d)
(e)
(1) Tree
(2) Eccentricity of a vertex
(3) Centre of Tree
(4) Rooted Tree
(5) Height of Tree
(6) Binary Tree
(7) Full Binary Tree
(8) Complete Binary Tree
(9) Binary Search Tree
(10)Minimum Spanning Tree
12. Find the Minimum Spanning Tree for the given graph using Kruskals algorithm.
13. Find the Minimum Spanning Tree for the given graph using Prims algorithm
14. Apply Dijkstras algorithm to find the shortest path between vertices 0 to 8 in the graph
shown below.
15. Construct the Binary Search Tree for the following sequence:
50,70,60,20,90,10,40,100
Also find Preorder, Inorder and Postorder traversal of binary search tree.
3. Consider the set Q of rational numbers, and let * be the operation on Q defined by
a*b=a+b-ab. Is (Q,*) a semigroup?