3.1 The good

A complete tree is usually considered “good” because it is balanced, and has the least height. In the case of a complete binary search tree, the time complexity to search for a particular value is Θ(log(n)), which is as good as it gets.