Which of the following is true about a binary search tree?
Practice Questions
Q1
Which of the following is true about a binary search tree?
All nodes have at most two children.
The left child is always greater than the parent.
The right child is always less than the parent.
The left child is always less than the parent.
Questions & Step-by-Step Solutions
Which of the following is true about a binary search tree?
Step 1: Understand what a binary search tree (BST) is. A BST is a type of data structure that stores values in a way that allows for efficient searching, adding, and removing of values.
Step 2: Learn the basic rule of a binary search tree. In a BST, for any given node (the parent), all values in the left subtree (left child) must be less than the value of the parent node.
Step 3: Understand the right subtree rule. In a BST, all values in the right subtree (right child) must be greater than the value of the parent node.
Step 4: Remember these two rules: left child < parent and right child > parent. This is what makes a binary search tree unique and efficient for searching.
