aversal the same binary tree Q7: Construct a binary tree by using postorder and inorder sequences given below. Inorder: N, M, P, O, Q Postorder: N, P, Q, O, M q8: Construct a binary tree using inorder and level order traversal given below. Inorder Traversal: 3, 4, 2, 1, 5, 8, 9 Level Order Traversal: 1, 4, 5, 9, 8, 2, 3 CS211 - Algorithms and Data Structures Page 1 of 4 Topic 6: Graphs Important concepts: Graph from a given DFS or BFS sequence DFS or BFS sequence of a given graph Dijkstra algorithm concepts and example Example Questions: Q1: A connected graph G without any cycles is called ........ a) Weighted graph b) DAG c) Tree d) None, if G is connected then it must contain a cycle Q2: What is the number of edges present in a complete graph having n vertices? a) (n*(n+1))/2 b) (n*(n-1))/2 c) n d) Information given is insufficient