This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: binary search tree. 6. Draw a graph having the given properties: Full binary tree, nine terminal (leaf) vertices, height = 3 . Explain why no such graph exists. 7. Given the following alphabets P T D H X M S J B E N K a) Create a binary search tree from the above alphabets. b) Write the traversal for Depth First Search in finding the letter ‘ M ’ based from the answer in question 7(a). c) Write the traversal for Breath First Search in finding the letter ‘ S ’ based from the answer in question 7(a). V2 V1 V3 V4 V5 V8 V6 V9 V7 V10 DCS5028 DISCRETE STRUCTURES TUTORIAL 7 3 8. Find the minimal spanning tree by using Prim’s algorithm for the graph below: 2 3 1 3 4 2 3 3 2 9. Find the minimal spanning tree by using Kruskal’s algorithm for the graph below: 4 1 12 6 7 5 11 14 8 13 3 9 2 10 10. Based on the tree diagram below, list the order in which the vertices are processed using preorder, inorder and postorder traversal. A B C D E F 1 2 3 4 5 6 1 2 3 4 5 6 7 8 9...
View
Full Document
 Spring '16
 NORIHAN BINTI HAMZAH
 Graph Theory, DCS5028 DISCRETE STRUCTURES

Click to edit the document details