Properties

• They are NOT Binary trees!!

• Nodes have exactly, either

  • Two children, or
  • Three children. (hence not binary)

• A 2-3 Tree containing n nodes has a maximum height of log(n+1) [regardless of what order items were inserted or removed.

• Therefore appears perfectly balanced.