Q1: Construct a binary search tree with the below information: • The preorder traversal of a binary search tree 10, 4, 3

[answerhappygod]

Q1 Construct A Binary Search Tree With The Below Information The Preorder Traversal Of A Binary Search Tree 10 4 3 1 (44.09 KiB) Viewed 15 times

Q1: Construct a binary search tree with the below information: • The preorder traversal of a binary search tree 10, 4, 3, 5, 11, 12. Q2: Construct a binary search tree by using postorder sequence given below. • Postorder: 2, 4, 3, 7, 9, 8, 5. Q3: Construct a binary tree using the following data: • The preorder traversal of a binary tree is 1, 2, 5, 3, 4. • The inorder traversal of the same binary tree is 2, 5, 1, 4, 3. Q4: Construct a binary tree by using postorder and inorder sequences given below. • Inorder: N, M, P, O, Q • Postorder: N, P, Q, O, M Q5: 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 Q6: Draw the directed graph that corresponds to this adjacency matrix: 0 1 2 3 0 | true false true false | 1 true false false false | 2 false false false true | 3 | true false true false | Q7: Draw the edge lists that correspond to the graph from the previous question.