Try this exercise. Is this statement true or false?
Balanced binary trees are binary trees in which the difference in the heights of its left and right subtrees is at most 2
Press true if you believe the statement is correct, or false otherwise.
Back to course sections
Mark As Completed Discussion