Try this exercise. Is this statement true or false?
Self-balancing binary search trees maintain the height of the tree to ensure efficient search, insert, and delete operations.
Press true if you believe the statement is correct, or false otherwise.

Self-balancing binary search trees maintain the height of the tree to ensure efficient search, insert, and delete operations.
Press true if you believe the statement is correct, or false otherwise.
