Try this exercise. Is this statement true or false?
Binary search trees always have a height of O(log n) where n is the number of nodes.
Press true if you believe the statement is correct, or false otherwise.
Back to course sections
Mark As Completed Discussion