The smallest element of the binary search tree must be in the le

The smallest element of the binary search tree must be in the left subtree of the root. ~@[](2)

答案：FALSE