Performance of BST

• Advantages:

  • Supports insertion, deletion and search in O(lg(n))*

• Disadvantages:

  • Even more complicated to program
    • Solved by: java.util.TreeMap
• Requires some way to “order” items in a precise, repeatable fashion.
• Poorly chosen/presented data can render the efficiency only linear time again [ O(n) ]