By Alison Neal

Summary: There are two approaches that can be taken to make sure that the Binary Search Tree always provides the best-case scenario. The first is known as a Weight Balanced (or Perfectly Balanced) Tree; the other, and the subject of this edition of Data Structures And Algorithms, is the Height Balanced (or AVL) Tree.

Please log on to read this subscriber-only article. If you do not have a subscription you can purchase one in the ClarionMag store.