Dale - Computer Science Illuminated 331

Dale - Computer Science Illuminated 331 - 304 Chapter 9...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
304 Chapter 9 Abstract Data Types and Algorithms Figure 9.17 Two varia- tions of a binary tree E A B C D H I J E F G AF BG D I CH J tree tree (a) A 4-level tree (b) A 10-level tree 15 tree 8 10 16 17 18 21 19 7 6 5 1 Figure 9.18 A binary search tree similarity of this approach to our binary search of a linear structure. We eliminate a large portion of the data with one comparison. Next we compare 18 with 17, the value in the root of the right subtree.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online