In a binary search tree, the left child of a node contains a value less than or equalto the node's value.*1 pointTRUEFALSE

Answer

The statement "In a binary search tree, the left child of a node contains a value less than or equal to the node's value" is TRUE.

Explanation

In a binary search tree (BST), the property of the tree ensures that for any given node:

1. The values in the left subtree (including the left child) are always less than or equal to the value of the node.
2. Conversely, the values in the right subtree are always greater than the node's value.

This property allows for efficient searching, insertion, and deletion operations, as it establishes a clear ordering of the values within the tree structure, enabling a logarithmic time complexity for these operations in the average case.

Thus, the statement accurately describes the fundamental characteristic of the left child in a binary search tree.