Which of the following is NOT a characteristic of a binary search tree (BST)?

Which of the following is NOT a characteristic of a binary search tree (BST)?

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 makes searching for them efficient.
Step 2: Learn the main characteristics of a BST. In a BST, for any given node, all values in the left subtree are less than the node's value, and all values in the right subtree are greater.
Step 3: Recognize that a node in a BST can have zero, one, or two children. This means that not every node needs to have two children; it can have none or just one.
Step 4: Identify the question's focus. The question asks which option is NOT a characteristic of a BST.
Step 5: Conclude that the statement about nodes not needing to have two children is true and is a characteristic of a BST.

No concepts available.