Try this exercise. Is this statement true or false?
Binary search trees always have a depth-first search traversal order.
Press true if you believe the statement is correct, or false otherwise.
Back to course sections
Mark As Completed Discussion
Binary search trees always have a depth-first search traversal order.
Press true if you believe the statement is correct, or false otherwise.