This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “AA Tree”. 1. AA Trees are implemented using? a) Colors b) Levels c) Node size d) Heaps 2. Which of the following is the correct definition for a horizontal link? a) connection between node and a child of equal levels … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Randomized Binary Search Tree”. 1. Which of the following is not a random tree? a) Treap b) Random Binary Tree c) Uniform Spanning Tree d) AVL Tree 2. Which process forms the randomized binary search tree? a) Stochastic Process b) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Self Balancing Binary Search Tree”. 1. Which of the following is not the self balancing binary search tree? a) AVL Tree b) 2-3-4 Tree c) Red – Black Tree d) Splay Tree 2. The binary tree sort implemented using a … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Balanced Binary Tree”. 1. What will be the height of a balanced full binary tree with 8 leaves? a) 8 b) 5 c) 6 d) 4 2. The balance factor of a node in a binary tree is defined as … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Binary Search Tree”. 1. Which of the following is false about a binary search tree? a) The left child is always lesser than its parent b) The right child is always greater than its parent c) The left and right sub-trees should … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Binary Tree”. 1. The number of edges from the root to the node is called __________ of the tree. a) Height b) Depth c) Length d) Width 2. The number of edges from the node to the deepest leaf is called _________ … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Inorder Traversal”. 1. For the tree below, write the in-order traversal. a) 6, 2, 5, 7, 11, 2, 5, 9, 4 b) 6, 5, 2, 11, 7, 4, 9, 5, 2 c) 2, 7, 2, 6, 5, 11, 5, 9, 4 d) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Postorder Traversal”. 1. In postorder traversal of binary tree right subtree is traversed before visiting root. a) True b) False 2. What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Preorder Traversal”. 1. For the tree below, write the pre-order traversal. a) 2, 7, 2, 6, 5, 11, 5, 9, 4 b) 2, 7, 5, 2, 6, 9, 5, 11, 4 c) 2, 5, 11, 6, 7, 4, 9, 5, 2 d) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Binary Tree Operations”. 1. What is the maximum number of children that a binary tree node can have? a) 0 b) 1 c) 2 d) 3 2. The following given tree is an example for? a) Binary tree b) Binary … Read more
