The first tree below is a binary search tree. The second tree a 2-3 search tree. To find the 46 node in the binary search tree would take four comparisons. Finding the 46 node in the 2-3 tree, depending on the order comparisons are made, could be done in only three comparisons. Contrast the characteristics of binary trees and 2-3 trees to explain why the 2-3 tree could be more efficient.

51 40 75 82 30 45 60 35 44 46 556780 87