MCQs

Disclaimer:

Educational Use Only:

The website links provided are to be used strictly for educational and knowledge-gaining purposes only.

No Misuse:

Do not misuse the links or the information contained therein for any commercial, illegal, or unethical activities.

Respect for Websites and Businesses:

Respect the intellectual property and business interests of the websites and their owners. Do not attempt to alter, copy, or redistribute content without proper authorization.

Acknowledge Value of Knowledge:

Recognize and value the knowledge and resources shared by these websites. Use the information responsibly and ethically.

No Endorsement:

The provision of these links does not imply endorsement of the linked sites, their content, or their products and services. Users are responsible for evaluating the suitability and accuracy of the information.

User Responsibility:

By accessing these links, you agree to use the information at your own risk and to comply with all applicable laws and website terms of use.

Overall MCQs for Reference

1. Which property is FALSE about a binary search tree?
   a. Left child is always lesser than its parent
   b. Right child is always greater than its parent
   c. Inorder sequence gives decreasing order of elements
   d. Both left and right sub-trees must be binary search trees
   Answer: c. Inorder sequence gives decreasing order of elementssanfoundry​
2. What is the time complexity of searching for an element in a Binary Search Tree (BST) in the worst case?
   a. O(n)
   b. O(log n)
   c. O(1)
   d. O(n^2)
   Answer: a. O(n)examveda​
3. Which traversal method of a BST will produce a sorted sequence of node values?
   a. Preorder
   b. Postorder
   c. Inorder
   d. Level order
   Answer: c. Inorderexamveda​
4. What is the maximum number of children a node in a Binary Search Tree (BST) can have?
   a. 1
   b. 2
   c. 3
   d. 4
   Answer: b. 2examveda​
5. How can you determine if a Binary Tree is a Binary Search Tree (BST)?
   a. All nodes are even
   b. All left descendants are lesser, all right descendants are greater
   c. All leaf nodes are full
   d. Each node has two children
   Answer: b. All left descendants are lesser, all right descendants are greaterexamveda​
6. Which operation can be performed in O(log n) time on a balanced Binary Search Tree?
   a. Traversal
   b. Insertion
   c. Searching
   d. Both b and c
   Answer: d. Both b and cexamveda​
7. What happens when you delete a node with two children from a BST?
   a. Node gets removed directly
   b. Replace node with max of left subtree or min of right subtree
   c. Replace with its parent
   d. Tree is restructured as AVL
   Answer: b. Replace node with max of left subtree or min of right subtreeexamveda​
8. What is the purpose of rotations in a Binary Search Tree?
   a. To balance the tree
   b. To sort the tree
   c. To increase height
   d. To find minimum value
   Answer: a. To balance the treeexamveda​
9. What is the term for a node in a BST that has no children?
   a. Leaf
   b. Root
   c. Internal
   d. External
   Answer: a. Leafexamveda​
10. In a BST, how do you find the minimum value node?
    a. Search the right-most node
    b. Traverse to the left-most node
    c. Find the largest element
    d. Look at the root
    Answer: b. Traverse to the left-most nodeexamveda​
11. What is a full binary tree in context of BST?
    a. All nodes have 1 child
    b. All nodes are leaves
    c. Each node has either 0 or 2 children
    d. Each node has 2 children
    Answer: c. Each node has either 0 or 2 childrentestbook​
12. What is a complete binary tree?
    a. Nodes on all levels except possibly the last are full, last level filled from left to right
    b. Every node has exactly two children
    c. All leaf nodes at last level
    d. Only root present
    Answer: a. Nodes on all levels except possibly the last are full, last level filled from left to righttestbook​
13. In a BST, where would you find the largest element?
    a. Root
    b. Left-most node
    c. Right-most node
    d. Any leaf node
    Answer: c. Right-most nodew3schools​
14. What type of BST is balanced so that left and right subtrees differ in height by at most one?
    a. Binary Heap Tree
    b. AVL Tree
    c. Red-Black Tree
    d. Complete Binary Tree
    Answer: b. AVL Treewayground​
15. Which data structure is commonly used for fast searching, retrieval, and insertion?
    a. Stack
    b. Queue
    c. Binary Search Tree
    d. Linked List
    Answer: c. Binary Search Treegeeksforgeeks​
16. What is the height of a BST referred to as?
    a. Number of edges from root to deepest leaf
    b. Sum of all node values
    c. Number of nodes
    d. Length of root to left-most node
    Answer: a. Number of edges from root to deepest leafcareerride​
17. Which machine learning task can extensively use binary search trees?
    a. Regression
    b. Decision Trees for classification
    c. Clustering
    d. Random Forest only
    Answer: b. Decision Trees for classificationheycoach​
18. Which operation is fastest in a BST if it is balanced?
    a. Traversal
    b. Search
    c. Both a and b
    d. Deletion
    Answer: c. Both a and bpwskills​
19. How do you check if a binary tree is a valid BST?
    a. Preorder traversal
    b. Verify all left descendants < node and right > node
    c. Postorder traversal
    d. Check number of leaves
    Answer: b. Verify all left descendants < node and right > nodew3schools​
20. Which algorithm uses BST for data compression?
    a. Huffman coding
    b. LZW
    c. Run Length Encoding
    d. Arithmetic coding
    Answer: a. Huffman codingguvi+1​
21. What is the worst-case time complexity for insertion in a BST?
    a. O(1)
    b. O(log n)
    c. O(n)
    d. O(n^2)
    Answer: c. O(n)geeksforgeeks​
22. Which database process often uses BSTs?
    a. Transaction logs
    b. Database indexing
    c. Backup
    d. Locking
    Answer: b. Database indexingupgrad+1​
23. What traversal yields descending order output in a BST?
    a. Preorder
    b. Inverse inorder
    c. Postorder
    d. Breadth-first
    Answer: b. Inverse inordersanfoundry​
24. What is “balanced” in context of balanced BST?
    a. All nodes at same depth
    b. Heights of the left and right subtrees differ by at most one
    c. All leaves same value
    d. Root always has two children
    Answer: b. Heights of the left and right subtrees differ by at most onewayground​
25. What is the primary use of BST in compilers?
    a. Manage identifiers and variable scopes
    b. Generate code
    c. Allocate memory
    d. Sort tokens
    Answer: a. Manage identifiers and variable scopesguvi​
26. What is the average time complexity to perform a search in a BST?
    a. O(n)
    b. O(1)
    c. O(log n)
    d. O(n^2)
    Answer: c. O(log n)pwskills​
27. Which type of BST self-balances after operations?
    a. AVL Tree
    b. Skew Tree
    c. B-Tree
    d. None
    Answer: a. AVL Treewayground​
28. If all nodes of a BST only have one child, which type of tree is it?
    a. Skewed Tree
    b. Complete Tree
    c. Full Tree
    d. AVL Tree
    Answer: a. Skewed Treegeeksforgeeks​
29. What is the minimum possible height of a BST with n nodes?
    a. 1
    b. log n
    c. n
    d. n/2
    Answer: b. log nw3schools​
30. Which operation can result in the violation of BST property?
    a. Search
    b. Insertion
    c. Deletion
    d. Both b and c
    Answer: d. Both b and cpwskills​
31. BSTs are NOT suitable when:
    a. Data is frequently inserted and deleted
    b. Data must be fetched fast
    c. Data requires large arrays
    d. Input is sorted while inserting
    Answer: d. Input is sorted while insertinggeeksforgeeks​
32. Which method finds the successor of a node in BST?
    a. Right child
    b. Left child
    c. Inorder traversal
    d. Preorder traversal
    Answer: c. Inorder traversalsanfoundry​
33. BSTs are mostly used in which application?
    a. Queue processing
    b. Stack management
    c. Symbol tables
    d. Array manipulation
    Answer: c. Symbol tablesguvi​
34. What results in an unbalanced BST?
    a. Randomly ordered input
    b. Inserting sorted input sequence
    c. Alternating insertions and deletions
    d. Using AVL rotations
    Answer: b. Inserting sorted input sequencegeeksforgeeks​
35. Which data structure allows for fast prefix-based queries using a tree structure in machine learning?
    a. Hash Table
    b. Heap
    c. BST
    d. Array
    Answer: c. BSTguvi​
36. What is the function of a comparator in BST insertion?
    a. Decides child position based on key comparison
    b. Adds duplicate keys
    c. Balances nodes directly
    d. Deletes non-leaf nodes
    Answer: a. Decides child position based on key comparisonwikipedia​
37. Which scenario causes BST to degrade to a linked list?
    a. Balanced input
    b. Random input
    c. Sorted input
    d. AVL balancing
    Answer: c. Sorted inputgeeksforgeeks​
38. What is the result of inorder traversal of a BST?
    a. Sorted elements in ascending order
    b. Sorted elements in descending order
    c. Random order
    d. Preordered elements
    Answer: a. Sorted elements in ascending ordersanfoundry​
39. What role do BSTs play in search engines and text editors?
    a. File indexing
    b. Real-time suggestions/autocomplete
    c. Sorting files
    d. Data encryption
    Answer: b. Real-time suggestions/autocompletepwskills+1​
40. What does a node with no left child represent, if traversed from root in BST?
    a. Minimum value node
    b. Maximum value node
    c. Null node
    d. Internal node
    Answer: a. Minimum value nodew3schools​
41. Which traversal algorithm is most suitable for generating a sorted list using BST?
    a. Preorder
    b. Inorder
    c. Postorder
    d. Level order
    Answer: b. Inordersanfoundry+1​
42. Which data structures optimize search functionalities in web or ML applications, such as OBSTs?
    a. Arrays
    b. Optimal Binary Search Trees
    c. Linked Lists
    d. Queues
    Answer: b. Optimal Binary Search Treesheycoach​
43. Which fundamental property does a BST rely on?
    a. Average of child values
    b. Key comparison at each node
    c. Equal depth subtree
    d. Leaf depth only
    Answer: b. Key comparison at each nodewikipedia+1​
44. Which traversal should be used to find the kth smallest element in BST?
    a. Inorder
    b. Postorder
    c. Preorder
    d. Level order
    Answer: a. Inorderexamveda​
45. Which statement is FALSE for BST?
    a. Minimum value found at left-most node
    b. Right child always greater than parent
    c. Height increases with random insertions
    d. BST cannot have duplicate keys
    Answer: d. BST cannot have duplicate keysw3schools​
46. What phenomenon occurs during deletion in BST that can violate balancing?
    a. Pyramid structure
    b. Skewness
    c. Leaf increase
    d. Key duplication
    Answer: b. Skewnesspwskills+1​
47. What type of search does BST enable?
    a. Linear search
    b. Binary search
    c. Exponential search
    d. Trie search
    Answer: b. Binary searchwikipedia​
48. What function does BST serve in memory managers?
    a. Track file metadata and allocate memory blocks
    b. Store program source code
    c. Manage stacks
    d. Schedule processes
    Answer: a. Track file metadata and allocate memory blocksguvi​
49. Which keyword is used repeatedly for insertion decision in BST algorithms?
    a. Compare
    b. Insert
    c. Equal
    d. Traverse
    Answer: a. Comparewikipedia​
50. If a BST is constructed with 31 unique nodes, what is the minimum possible height?
    a. 15
    b. 5
    c. 16
    d. 31
    Answer: b. 5w3schools​

1. https://www.sanfoundry.com/data-structure-questions-answers-binary-search-tree/
2. https://www.examveda.com/data-structure/practice-mcq-question-on-binary-search-trees(b-tree)/
3. https://testbook.com/objective-questions/mcq-on-binary-search-tree–5eea6a1139140f30f369eb9e
4. https://www.w3schools.com/dsa/dsa_data_binarysearchtrees.php
5. https://wayground.com/admin/quiz/5f64233c2a74e5001c11fc10/binary-search-trees
6. https://www.geeksforgeeks.org/dsa/applications-advantages-and-disadvantages-of-binary-search-tree/
7. https://www.careerride.com/view/mcqs-on-tree-with-answers-19636.aspx
8. https://heycoach.in/blog/optimal-binary-search-tree-in-searching-applications/
9. https://pwskills.com/blog/binary-search-trees-and-its-uses/
10. https://www.guvi.in/blog/binary-tree-vs-binary-search-tree/
11. https://www.upgrad.com/blog/what-is-binary-search-tree-everything-you-need-to-know/
12. https://www.geeksforgeeks.org/quizzes/top-mcqs-on-binary-trees-data-structure-with-answers/
13. https://en.wikipedia.org/wiki/Binary_search_tree
14. https://www.geeksforgeeks.org/quizzes/top-mcqs-on-binary-search-tree-bst-data-structure-with-answers/
15. https://www.scribd.com/document/626193506/mcq-on-tree-data-structures
16. https://www.scribd.com/document/563739389/BST-MCQ-converted
17. https://siteforinfotech.com/2017/02/top-20-mcq-questions-trees-application.html
18. https://www.sanfoundry.com/data-structure-questions-answers-binary-tree-properties/
19. https://ijritcc.org/index.php/ijritcc/article/view/5018