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. The number of edges from the root to a node is called the:
   a. Height
   b. Depth
   c. Length
   d. Width
   Answer: b. Depthsanfoundry​
2. The number of edges from a node to the deepest leaf is called the:
   a. Height
   b. Depth
   c. Length
   d. Width
   Answer: a. Heightsanfoundry​
3. In a full binary tree, each node has:
   a. Exactly one child
   b. Exactly two children
   c. Zero or two children
   d. At least one child
   Answer: c. Zero or two childrensanfoundry​
4. In a complete binary tree:
   a. Every node has two children
   b. Every level is fully filled except possibly the last, which is filled from left to right
   c. Every node is a leaf
   d. All nodes contain the same value
   Answer: b. Every level is fully filled except possibly the last, which is filled from left to rightsanfoundry​
5. What is the maximum number of children that a binary tree node can have?
   a. 0
   b. 1
   c. 2
   d. 3
   Answer: c. 2sanfoundry​
6. In a binary tree, the left child of the root, if present, is:
   a. The only child
   b. The parent of the right child
   c. At index 2i+1 in array representation
   d. Always a leaf
   Answer: c. At index 2i+1 in array representationexamradar​
7. In a binary tree, the parent of a node at index i in array representation is at:
   a. i/2
   b. 2i+1
   c. (i-1)/2
   d. i-1
   Answer: c. (i-1)/2examradar​
8. The minimum number of nodes in a non-empty binary tree of height h is:
   a. h
   b. h+1
   c. 2h-1
   d. h-1
   Answer: b. h+1studocu​
9. A binary tree in which every node has either 0 or 2 children is called:
   a. Complete Binary Tree
   b. Full Binary Tree
   c. Balanced Binary Tree
   d. Skewed Binary Tree
   Answer: b. Full Binary Treesanfoundry​
10. Which binary tree traversal visits nodes in the order: left, root, right?
    a. Preorder
    b. Postorder
    c. Inorder
    d. Level order
    Answer: c. Inorderanalytixlabs​
11. Which operation is NOT typically performed on binary trees?
    a. Insertion
    b. Sorting
    c. Searching
    d. Traversal
    Answer: b. Sortinganalytixlabs​
12. What is meant by the height of a binary tree?
    a. Number of nodes
    b. Number of edges in the longest path from root to leaf
    c. Sum of all node values
    d. Maximum outdegree
    Answer: b. Number of edges in the longest path from root to leafstudocu​
13. Which of the following is NOT a type of binary tree?
    a. AVL tree
    b. Red-Black tree
    c. Trie
    d. Complete tree
    Answer: c. Trieanalytixlabs​
14. In a binary search tree, every node’s right child contains a value:
    a. Greater than or equal to the node
    b. Less than or equal to the node
    c. Equal to the node
    d. Randomly assigned
    Answer: a. Greater than or equal to the nodeanalytixlabs​
15. Which application is NOT typically associated with binary trees?
    a. Decision trees in machine learning
    b. Network packet switching
    c. Database indexing
    d. Expression parsing
    Answer: b. Network packet switchinganalytixlabs​
16. A perfectly balanced binary tree with 7 nodes has height:
    a. 2
    b. 3
    c. 4
    d. 1
    Answer: a. 2scribd​
17. In a binary tree, what is the degree of a node with 2 children?
    a. 1
    b. 0
    c. 2
    d. Cannot be determined
    Answer: c. 2testbook​
18. What is the minimum possible height of a binary tree with 31 nodes?
    a. 4
    b. 5
    c. 15
    d. 31
    Answer: b. 5studocu​
19. The process of visiting the root node before its subtrees is called:
    a. Inorder traversal
    b. Preorder traversal
    c. Postorder traversal
    d. Level-order traversal
    Answer: b. Preorder traversalanalytixlabs​
20. Which representation is generally space-efficient for a complete binary tree?
    a. Array-based
    b. Linked list
    c. Stack
    d. Queue
    Answer: a. Array-basedexamradar​
21. Which of the following binary trees has the maximum number of nodes at level l (root at level 0)?
    a. l^2
    b. 2^l
    c. l+1
    d. 2l
    Answer: b. 2^lsanfoundry​
22. A binary search tree is a type of:
    a. Graph
    b. Complete binary tree
    c. Ordered binary tree
    d. Heap
    Answer: c. Ordered binary treeanalytixlabs​
23. A binary tree is a special type of:
    a. Array
    b. Graph
    c. Queue
    d. Linked list
    Answer: b. Graphdevinterview​
24. For a binary tree with n leaf nodes, how many nodes with two children?
    a. n-1
    b. n+1
    c. 2n
    d. n
    Answer: a. n-1testbook​
25. Which structure is used for implementing recursion that traverses a binary tree?
    a. Queue
    b. Stack
    c. Array
    d. Graph
    Answer: b. Stackanalytixlabs​
26. In a binary tree, nodes without children are called:
    a. Leaves
    b. Roots
    c. Parents
    d. Internal nodes
    Answer: a. Leavesanalytixlabs​
27. Which algorithm does NOT require a binary tree?
    a. Huffman encoding
    b. Heap sort
    c. Linear search
    d. Expression evaluation
    Answer: c. Linear searchanalytixlabs​
28. The in-order traversal of a BST will output values in:
    a. Random order
    b. Decreasing order
    c. Level order
    d. Increasing order
    Answer: d. Increasing orderanalytixlabs​
29. What is the difference between AVL tree and regular BST?
    a. AVL is indexed
    b. AVL is always balanced
    c. BST cannot be traversed
    d. AVL only stores integers
    Answer: b. AVL is always balancedanalytixlabs​
30. A binary tree is called strictly binary if every non-leaf node has:
    a. Exactly two children
    b. At most two children
    c. At least one child
    d. Only one child
    Answer: a. Exactly two childrenscribd​
31. The time complexity for searching in a balanced binary search tree is:
    a. O(n)
    b. O(n^2)
    c. O(log n)
    d. O(1)
    Answer: c. O(log n)analytixlabs​
32. The post-order traversal visits a node:
    a. Before its children
    b. After its left child only
    c. After its children
    d. Randomly
    Answer: c. After its childrenanalytixlabs​
33. Which node is called the root in a binary tree?
    a. Lowest node
    b. Middle node
    c. Top-most node
    d. Any node
    Answer: c. Top-most nodeexamradar​
34. If a node has only right child, it is called:
    a. Unary node
    b. Internal node
    c. Skewed node
    d. External node
    Answer: b. Internal nodeanalytixlabs​
35. A degenerate (or pathological) tree is:
    a. Always balanced
    b. Every parent has only one child
    c. Never exists in practice
    d. All leaves at same level
    Answer: b. Every parent has only one childsanfoundry​
36. The level of the root node of a binary tree is:
    a. 2
    b. -1
    c. 0
    d. 1
    Answer: c. 0sanfoundry​
37. The number of null pointers in a binary tree with n nodes is:
    a. n
    b. n+1
    c. 2n
    d. n-1
    Answer: c. 2nanalytixlabs​
38. When every node in a binary tree has a value greater than all its descendants, the tree is called:
    a. Binary search tree
    b. Max-Heap
    c. Min-Heap
    d. AVL tree
    Answer: b. Max-Heapanalytixlabs​
39. Which traversal method is defined recursively as traverse left subtree, visit root, traverse right subtree?
    a. Preorder
    b. Postorder
    c. Inorder
    d. Level-order
    Answer: c. Inorderanalytixlabs​
40. Which one of the following is not an application of binary trees?
    a. Searching
    b. Sorting
    c. Priority queue
    d. Network routing
    Answer: d. Network routinganalytixlabs​
41. The sum of external path lengths minus internal path lengths in a binary tree with n internal nodes is:
    a. n
    b. n+1
    c. 2n
    d. 1
    Answer: c. 2nstudocu​
42. Which algorithm can be used for finding shortest path in a binary tree?
    a. Dijkstra’s
    b. BFS
    c. Kruskal’s
    d. DFS
    Answer: b. BFSanalytixlabs​
43. How many different binary trees can be created with three nodes?
    a. 3
    b. 4
    c. 5
    d. 6
    Answer: c. 5testbook​
44. In a binary tree, an empty tree is represented by:
    a. Node with data 0
    b. Null pointer
    c. Special leaf node
    d. Node with negative value
    Answer: b. Null pointerexamradar​
45. The maximum number of nodes in a binary tree of height h is:
    a. 2^h – 1
    b. 2^{h+1} – 1
    c. h^2
    d. 2*h
    Answer: b. 2^{h+1} – 1studocu​
46. The main advantage of a binary heap over BST for implementing a priority queue is:
    a. Less memory
    b. Faster inserts and deletes
    c. Simpler structure
    d. Guaranteed balance
    Answer: b. Faster inserts and deletesanalytixlabs​
47. What is the worst-case height of a binary search tree with n nodes?
    a. log n
    b. n/2
    c. n-1
    d. 2n
    Answer: c. n-1analytixlabs​
48. Which traversal method can be implemented without recursion or stack?
    a. Preorder
    b. Postorder
    c. Level-order
    d. Inorder
    Answer: c. Level-orderanalytixlabs​
49. In which scenario does a binary tree degenerate to a linked list?
    a. Every node has two children
    b. One subtree is always empty
    c. Tree is perfectly balanced
    d. Every leaf is at the same level
    Answer: b. One subtree is always emptyanalytixlabs​
50. Which property distinguishes a complete binary tree from a strictly binary tree?
    a. All leaves at same level
    b. All non-leaf nodes have two children
    c. All levels except the last are full, last filled left to right
    d. All internal nodes are balanced
    Answer: c. All levels except the last are full, last filled left to righttestbook+1​

1. https://www.sanfoundry.com/data-structure-questions-answers-binary-tree-properties/
2. https://www.sanfoundry.com/binary-tree-operations-multiple-choice-questions-answers-mcqs/
3. https://examradar.com/binary-trees/
4. https://www.studocu.com/in/document/srm-institute-of-science-and-technology/data-structures-and-algorithms/mcq-on-tree-data-structures/24424242
5. https://www.analytixlabs.co.in/blog/binary-tree-in-data-structure/
6. https://www.scribd.com/document/626193506/mcq-on-tree-data-structures
7. https://testbook.com/objective-questions/mcq-on-representation-of-binary-tree–5eea6a1139140f30f369eb93
8. https://devinterview.io/questions/data-structures-and-algorithms/tree-data-structure-interview-questions/
9. https://testbook.com/objective-questions/mcq-on-complete-binary-tree–5eea6a1139140f30f369eb9b
10. https://www.geeksforgeeks.org/quizzes/top-mcqs-on-binary-trees-data-structure-with-answers/
11. https://testbook.com/objective-questions/mcq-on-binary-search-tree–5eea6a1139140f30f369eb9e
12. https://www.geeksforgeeks.org/dsa/top-50-tree-coding-problems-for-interviews/
13. https://www.youtube.com/watch?v=Q3HH6bE2bwA
14. https://erp.metbhujbalknowledgecity.ac.in/StudyMaterial/01KA092008003280012.pdf
15. https://examradar.com/data-structure-binary-trees-mcq-based-online-test-1/
16. https://www.scribd.com/document/748504764/Binary-Trees-Ques
17. https://www.scribd.com/document/732891011/CAT-2-Sample-MCQ
18. https://www.interviewbit.com/data-structure-interview-questions/
19. https://www.interviewbit.com/data-structure-mcq/
20. https://www.careers360.com/courses-certifications/articles/binary-tree-interview-questions-and-answers