Binary Search Trees (BST) MCQsBy: Prof. Dr. Fazal Rehman | Last updated: May 15, 2025 19 Score: 0 Attempted: 0/19 Subscribe 1. : What is a Binary Search Tree (BST)? (A) A tree where each node has exactly one child (B) A tree where each node has at most two children (C) A tree where the left subtree is greater than the root and the right subtree is less than the root (D) A tree where the left subtree is less than the root and the right subtree is greater than the root 2. : Which property of Binary Search Trees allows for efficient searching, insertion, and deletion operations? (A) Complete binary structure (B) Balanced height (C) Symmetric nodes (D) Binary search property 3. : What is the time complexity of searching for an element in a Binary Search Tree (BST) with n nodes, assuming the tree is balanced? (A) O(1) (B) O(log n) (C) O(n) (D) O(n log n) 4. : Which traversal of a Binary Search Tree (BST) visits nodes in non-decreasing order? (A) Preorder (B) Inorder (C) Postorder (D) Level order 5. : In a Binary Search Tree (BST), which operation is used to find the minimum element? (A) minElement() (B) findMin() (C) getMinimum() (D) minimum() 6. : What is the worst-case time complexity of inserting an element into a Binary Search Tree (BST) of height h? (A) O(1) (B) O(h) (C) O(log h) (D) O(n) 7. : Which traversal of a Binary Search Tree (BST) starts from the root, visits the left subtree, and then visits the right subtree? (A) Preorder (B) Inorder (C) Postorder (D) Level order 8. : Which of the following statements is true about all Binary Search Trees (BST)? (A) They are complete binary trees (B) They have symmetric nodes (C) They have a unique binary search property (D) They have nodes arranged in a specific order 9. : Which operation of a Binary Search Tree (BST) deletes a node with two children? (A) deleteNode() (B) remove() (C) erase() (D) delete() 10. : In a Binary Search Tree (BST), which operation is used to find the successor of a given node? (A) findSuccessor() (B) successor() (C) next() (D) nextNode() 11. : Which of the following operations requires the worst-case time complexity in a Binary Search Tree (BST)? (A) Searching (B) Insertion (C) Deletion (D) Traversal 12. : Which traversal of a Binary Search Tree (BST) visits nodes in descending order of their values? (A) Preorder (B) Inorder (C) Postorder (D) Reverse Inorder 13. : In a Binary Search Tree (BST), what is the height of a tree with n nodes in the worst case? (A) log n (B) n (C) n (D) n log n 14. : Which traversal of a Binary Search Tree (BST) can be used to print the elements in sorted order? (A) Preorder (B) Inorder (C) Postorder (D) Level order 15. : In a Binary Search Tree (BST), what is the maximum number of edges in a path from the root to a leaf node? (A) log n (B) n (C) n (D) n – 1 16. : Which operation of a Binary Search Tree (BST) returns the maximum element? (A) maxElement() (B) findMax() (C) getMaximum() (D) maximum() 17. : Which of the following is NOT a valid property of Binary Search Trees (BST)? (A) All nodes in the left subtree are less than the root (B) All nodes in the right subtree are greater than the root (C) There can be duplicate nodes (D) Inorder traversal visits nodes in non-decreasing order 18. : Which traversal of a Binary Search Tree (BST) visits nodes level by level? (A) Preorder (B) Inorder (C) Postorder (D) Level order 19. : Which of the following statements is true about Binary Search Trees (BST)? (A) They can have nodes with only one child (B) They have nodes arranged in a specific order (C) They require nodes to be symmetric (D) They support only recursive operations Data Structures MCQs Basic Concepts Introduction to Data Structures Abstract Data Types (ADT) MCQs Complexity Analysis MCQs Time complexity MCQs Space complexity MCQs Big O, Big Ω, Big Θ notations MCQs Linear Data Structures MCQs Arrays MCQs One-dimensional arrays MCQs Multi-dimensional arrays MCQs Operations: traversal, insertion, deletion MCQs Linked Lists MCQs Singly linked list MCQs Doubly linked list MCQs Circular linked list MCQs Stacks MCQs Stack operations (push, pop, peek) MCQs Applications of stacks (expression evaluation, recursion) MCQs Queues MCQs Queue operations (enqueue, dequeue, front, rear) MCQs Types: Simple queue, circular queue, priority queue, deque MCQs Non-Linear Data Structures MCQs Trees MCQs Binary trees MCQs Binary Search Trees (BST) MCQs AVL Trees MCQs B-trees and B+ trees MCQs Tree traversal methods (in-order, pre-order, post-order) MCQs Heaps MCQs Min-heap MCQs Max-heap MCQs Heap operations (insertion, deletion, heapify) MCQs Applications of heaps (priority queues, heap sort) MCQs Graphs MCQs Graph representation (adjacency matrix, adjacency list) MCQs Graph traversal algorithms (DFS, BFS) MCQs Shortest path algorithms (Dijkstra’s, Bellman-Ford) MCQs Minimum Spanning Tree (Kruskal’s, Prim’s) MCQs Hashing MCQs MCQs Hash Tables Hash functions MCQs Collision resolution techniques (chaining, open addressing) MCQs Applications of hashing MCQs Sorting and Searching Algorithms MCQs Sorting Algorithms MCQs Bubble sort MCQs Selection sort MCQs Insertion sort MCQs Merge sort MCQs Quick sort MCQs Heap sort MCQs Searching Algorithms MCQs Linear search MCQs Binary search MCQs Interpolation search MCQs Miscellaneous Memory Management in data structures MCQs Dynamic memory allocation MCQs Garbage collection MCQs String Manipulation Algorithms MCQs Pattern matching (KMP, Rabin-Karp) MCQs String hashing MCQs Data Structures MCQs 1 Data Structures MCQs 2 Data Structures MCQs 3 Data Structures MCQs 4 Data Structures MCQs 5 Stacks Solved MCQs Queues MCQs pointer mcqs Array MCQs Related Posts:B-trees and B+ trees MCQsBinary trees MCQsTop 10 Search Engine for SEO Search engine optimizationDesired numbers of search results in one search pageBinary search MCQsProgram to Implement Binary Search in CPP (C plus plus)