Question

A binary search tree (BS

  • T property states that for any given node:
A All nodes in its left subtree are greater than the node's value.
B All nodes in its right subtree are less than the node's value.
C All nodes in its left subtree are less than or equal to the node's value, and all nodes in its right subtree are greater than or equal to the node's value.
D The left subtree always has more nodes than the right subtree.
E The tree must be perfectly balanced.
Practice Next

Hey! Ask a query