Binary Search Trees Chapter 19
Binary Search Trees Chapter 19
Binary Search Trees Chapter 19
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Figure <strong>19</strong>.<strong>19</strong>(a) The balanced tree has a depth of log N; (b) the unbalanced tree has adepth of N – 1.Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley