with treethe worst-case scenario is three comparisonssearching for requires two steps noticehoweverthat if you insert the elements into the tree in the order then the tree would not be more efficient than the list we would have to balance the tree firstso not only is it important to use bst but choosing self-balancing tree helps to improve the search operation