Start learning →

In a binary search tree, every value in a node's right subtree is:

AGreater
BLesser
CEqual
DRandom
Answer & Solution
Correct answer: A. Greater
1. The search property orders the tree. 2. Larger values are kept to the right. 3. So they are greater. _Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._
Practise this question with Quill — Coding Interview Prep →

Keep practising Data Structures and Algorithms

Browse all Data Structures and Algorithms questions for Coding Interview Prep, or explore more Computer Science topics.

Start a Data Structures and Algorithms lesson →
Related questions
Algorithms bingoType the numberSort the computing ideasArray or linkedSlice the structuresRun the algorithm gatesPop the growth classesCatch the data structures