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

Which of the following is TRUE about a tree data structure?
a. It is a linear structure
b. It is a hierarchical structure
c. It always has cycles
d. It cannot be used for storage
Answer: b. It is a hierarchical structuregeeksforgeeks+1
What is the topmost node of a tree called?
a. Leaf
b. Child
c. Root
d. Branch
Answer: c. Rootprepinsta+1
In a binary tree, what is the maximum number of children a node can have?
a. 1
b. 2
c. 3
d. 4
Answer: b. 2examveda+1
A node with no children in a tree is called:
a. Branch
b. Root
c. Leaf
d. Parent
Answer: c. Leafexamveda+1
Which traversal method visits the root node first, then left subtree, and then right subtree?
a. Inorder
b. Preorder
c. Postorder
d. Level order
Answer: b. Preordergeeksforgeeks+1
What is the degree of a node in a tree?
a. Number of children
b. Number of siblings
c. Number of ancestors
d. Its value
Answer: a. Number of childrenprepinsta+1
In a full binary tree with n leaf nodes, the number of nodes of degree 2 is:
a. n
b. n-1
c. log2n
d. 2n
Answer: b. n-1scribd+1
Which of the following is NOT a tree traversal algorithm?
a. Inorder
b. Preorder
c. Random order
d. Postorder
Answer: c. Random orderexamveda+1
A binary search tree (BST) always follows which rule?
a. Root is the smallest
b. Left < Root < Right
c. All nodes are equal
d. No parent pointers
Answer: b. Left < Root < Rightgeeksforgeeks+1
What is the minimum number of nodes in a non-empty binary tree of height h?
a. h
b. h+1
c. 2^h
d. h-1
Answer: b. h+1studocu+1
Trees are mainly used to represent:
a. Hierarchical data
b. Linear lists
c. Circular queues
d. Single elements
Answer: a. Hierarchical dataccbp+1
Which of the following tree types is self-balancing?
a. Binary tree
b. AVL tree
c. Tree map
d. Red-Black tree
Answer: b. AVL treetestbook+1
Which data structure is best suitable for priority queue implementation?
a. Stack
b. Queue
c. Heap
d. Binary search tree
Answer: c. Heapiquanta+1
Which of these is a balanced search tree suitable for database indexing?
a. AVL tree
b. Heap
c. B-tree
d. Trie
Answer: c. B-treetestbook+1
Which protocol in networking uses trees to prevent network loops?
a. TCP
b. UDP
c. Spanning Tree Protocol
d. FTP
Answer: c. Spanning Tree Protocolalmabetter+1
In a decision tree, what does each internal node represent?
a. Output
b. A test on an attribute
c. Final prediction
d. None
Answer: b. A test on an attributeaimcqs+1
Which tree is most suited for range query operations like sum or min in an array?
a. B-tree
b. Segment tree
c. Trie
d. AVL tree
Answer: b. Segment treetecharticle+1
In a threaded binary tree:
a. All left child pointers are null
b. Null pointers are replaced with special links
c. Each node only has one child
d. No parent pointers exist
Answer: b. Null pointers are replaced with special linksscribd+1
Which search algorithm utilizes trees for its implementation in AI?
a. Brute Force
b. Greedy
c. A*
d. Linear
Answer: c. A*herovired+1
The time complexity of searching in a balanced binary search tree is:
a. O(1)
b. O(log n)
c. O(n)
d. O(n^2)
Answer: b. O(log n)geeksforgeeks+1
A tree with a node degree greater than two is called:
a. Binary tree
b. N-ary tree
c. AVL tree
d. Heap
Answer: b. N-ary treeherovired+1
Which of the following trees is used in Trie data structure applications like autocomplete?
a. Segment tree
b. AVL tree
c. Suffix tree
d. Trie
Answer: d. Trieiquanta+1
Which is the fastest way to find the minimum in a min-heap?
a. Root node
b. Leftmost leaf
c. Rightmost leaf
d. Any node
Answer: a. Root nodeprepinsta+1
Which kind of tree is used for the k-Nearest Neighbors (KNN) algorithm?
a. Binary Search Tree
b. AVL Tree
c. KD-Tree
d. Heap
Answer: c. KD-Treeiquanta+1
The total number of nodes in a complete binary tree of height h is:
a. 2h+1 – 1
b. h
c. h+1
d. 2h
Answer: a. 2h+1 – 1geeksforgeeks+1
What is the main application of a suffix tree in text processing?
a. Range query
b. Pattern matching
c. Network routing
d. Sorting
Answer: b. Pattern matchingprepinsta+1
Which traversal outputs nodes level-by-level from top to bottom?
a. Preorder
b. Inorder
c. Postorder
d. Level order
Answer: d. Level ordergeeksforgeeks+1
The parent-child relationship in a tree is best described as:
a. Many-to-Many
b. One-to-One
c. One-to-Many
d. Many-to-One
Answer: c. One-to-Manygeeksforgeeks+1
Which tree structure organizes multidimensional points efficiently?
a. B-Tree
b. Trie
c. KD-Tree
d. Segment Tree
Answer: c. KD-Treeiquanta+1
Which type of tree is commonly used by file systems?
a. Segment tree
b. B-tree
c. Heap
d. AVL tree
Answer: b. B-treetecharticle+1
In a tree, the path from root to any node contains:
a. Only nodes
b. Nodes and edges
c. Only leaves
d. Only branches
Answer: b. Nodes and edgesscaler+1
Which of the following is NOT an application of tree structures?
a. File systems
b. Network routing
c. Flat lists
d. Database indexing
Answer: c. Flat listsprepinsta+1
A tree that maintains equal black heights on all root-to-leaf paths is:
a. AVL tree
b. Red-Black tree
c. B-tree
d. Complete binary tree
Answer: b. Red-Black treetestbook+1
Which of the following is a major drawback of decision trees?
a. Underfitting
b. Overfitting
c. Slow speed
d. No interpretability
Answer: b. Overfittinginterviewbit+1
What is the time complexity for insertion in a heap?
a. O(1)
b. O(log n)
c. O(n)
d. O(n^2)
Answer: b. O(log n)geeksforgeeks+1
Which property is unique to a binary search tree?
a. Unordered elements
b. Each node has at most two children
c. Left subtree values < node value < right subtree values
d. Every node has a parent
Answer: c. Left subtree values < node value < right subtree valuesgeeksforgeeks+1
Which algorithm constructs an optimal binary tree for Huffman coding?
a. Dijkstra’s algorithm
b. Kruskal’s algorithm
c. Huffman’s algorithm
d. Prim’s algorithm
Answer: c. Huffman’s algorithmtestbook+1
What is the height of a tree with a single node?
a. 1
b. 0
c. 2
d. -1
Answer: b. 0examveda+1
Which algorithm is used to find the shortest path in a tree?
a. Kruskal’s algorithm
b. Breadth First Search (BFS)
c. Linear Search
d. HeapSort
Answer: b. Breadth First Search (BFS)geeksforgeeks+1
Which is true about the number of edges in a tree with n nodes?
a. n
b. n+1
c. n-1
d. 2n-1
Answer: c. n-1scribd+1
Trees are useful in AI for which process?
a. Linear regression
b. Clustering
c. Decision making
d. Text formatting
Answer: c. Decision makingalmabetter+1
A tree where every non-leaf node has exactly two children is:
a. Complete binary tree
b. Full binary tree
c. General tree
d. Suffix tree
Answer: b. Full binary treeexamveda+1
Which node is not present in a binary search tree?
a. Duplicate nodes
b. Root node
c. Internal node
d. Leaf node
Answer: a. Duplicate nodesgeeksforgeeks+1
Which tree is mainly used for auto-completion features?
a. Segment tree
b. Trie
c. AVL tree
d. Heap
Answer: b. Trieiquanta+1
Which of the following tree types is NOT balanced?
a. AVL tree
b. Red-black tree
c. Binary search tree (unrestricted)
d. B-tree
Answer: c. Binary search tree (unrestricted)testbook+1
What is a forest in data structure terms?
a. Single tree
b. Set of disjoint trees
c. Set of linked lists
d. Heap structure
Answer: b. Set of disjoint treesgeeksforgeeks+1
In a k-ary tree, each internal node has:
a. k children
b. At least two children
c. At most k children
d. One child
Answer: c. At most k childrenprepinsta+1
Which tree variant is vital for memory-efficient prefix search?
a. Heap
b. Trie
c. AVL tree
d. Segment tree
Answer: b. Trieiquanta+1
Which is NOT a characteristic of a tree?
a. Acyclic
b. Hierarchical
c. Directed edges
d. All nodes are connected
Answer: c. Directed edgesgeeksforgeeks+1
Which tree data structure is best for dynamic set operations like union and find?
a. AVL tree
b. Segment tree
c. Binary search tree
d. Disjoint Set (Union-Find) tree
Answer: d. Disjoint Set (Union-Find) treeprepinsta+1

Blog

Systemethic Technologies

Leave a Reply Cancel reply

Useful links

Other Terms & Policies

Contact Info