Question: Select all which are true regarding binary search trees. Preorder tree traversal returns a sorted list Nodes may have more than 2 children When properly
Select all which are true regarding binary search trees.
Preorder tree traversal returns a sorted list
Nodes may have more than children
When properly sorted, but unbalanced, it could be as slow as linear search.
When properly sorted and balanced, its search worst and average cases are faster than linear search.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
