CS60_2008-11-06_weekX_thurs

CS60_2008-11-06_weekX_thurs - CMPSC 60 2008-11-06 Tree...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CMPSC 60 2008-11-06 Tree structures Binary search tree Left is <; right is ≥ 31 7 53 6 9 13 21 preorder inorder visit, left, right left, visit, right  can be used as a pretty fast sort postorder left, right, visit 1 Special application: expression tree 3 2 +8 ×4−3 (−) (×) 3 4 (+) 8 (÷) 3 2 2 ...
View Full Document

Page1 / 2

CS60_2008-11-06_weekX_thurs - CMPSC 60 2008-11-06 Tree...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online