Try this exercise. Is this statement true or false?
Binary search trees are a type of binary tree where each node's left child is always smaller and its right child is always larger.
Press true if you believe the statement is correct, or false otherwise.