Select the correct name for: a binary tree in which each node's left subtree contains smaller values and right subtree contains larger values.
Difficulty: Hard
About this MCQ
This Hard Data Structures question asks: Select the correct name for: a binary tree in which each node's left subtree contains smaller values and right subtree contains larger values. The correct choice is C. Binary search tree. Read the options below, commit to one, then use the explanation to see why that choice holds and why the others do not.
Data Structures items like this one are written for Pakistan exams such as CSS, FPSC, PPSC, and NTS. The difficulty label is a hint about how much of the topic the stem assumes, not a score. Tags and exam names, when they are present, tell you where else the same idea is tested. Previous and next links stay in Data Structures so you can continue the subject. Related questions point at nearby stems if you want another angle on the same idea.
Treat the explanation as part of the question, not a footnote. If you missed it, reread the stem against the correct option before you open the next Data Structures item. A timed quiz is the same pool with a clock and a score. A past paper is a full sitting rather than this single question.
- A. Queue
Why not A: “Queue” does not fit this question. The answer is Binary search tree.
- B. Array (contiguous memory)
Why not B: “Array (contiguous memory)” does not fit this question. The answer is Binary search tree.
- C. Binary search tree ✓
- D. Graph
Why not D: “Graph” does not fit this question. The answer is Binary search tree.
Correct answer
C. Binary search tree
Explanation
Binary search tree (option C) is the accepted answer to “Select the correct name for: a binary tree in which each node's left subtree contains smaller values and right subtree contains larger values.”. Option A (Queue) does not fit this question. Option B (Array (contiguous memory)) does not fit this question. Option D (Graph) does not fit this question. For this Data Structures question, the accepted answer is Binary search tree.
Source: Data Structures Official Reference Guide
Tags: computer science, data structures, algorithms, programming
Submitted by: MCQsHub Editorial
Related MCQs
- What term describes the following? a tree-based structure that satisfies the heap property, often used to impl...
- Which concept is defined as follows: a tree-like data structure used to efficiently store and retrieve strings...
- Identify the correct definition of Graph.
- What is Trie primarily used for?
- The concept in which a data structure consisting of nodes (vertices) connected by edges, used to represent rel...
- The following statement describes a specific concept. What is it called? a linked list in which the last node...