Lecture21 - Midterm 2 Stats 90-100 80-89 70-79 60-69 50-59...

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

View Full Document Right Arrow Icon
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 1 Midterm 2 Stats Midterm 2 Stats 1 2 23 27 25 10 40-49 50-59 60-69 70-79 80-89 90-100 High = 96 Avg = 76.3 Low = 48 n = 88 ave = 76.3
Background image of page 1

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

View Full DocumentRight Arrow Icon
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 2 Announcements Announcements 5 Deb's Office: 5376 CS Read Chapter 28 Student Research: Academic Conduct Survey
Background image of page 2
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 3 Last Lecture Last Lecture 5 More Tree Terms Types of Trees Tree Traversals Binary Search Tree
Background image of page 3

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

View Full DocumentRight Arrow Icon
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 4 This Lecture This Lecture 5 Depth-first vs Breadth-first traversals Binary Tree Examples Binary Search Tree Expression Trees Binary Heaps Implementation Binary Search Tree Implementation
Background image of page 4
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 5 Traversals Traversals 5 Depth-first traversals preorder inorder postorder Breadth-first traversal level order
Background image of page 5

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

View Full DocumentRight Arrow Icon
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 6 Binary Search Tree Binary Search Tree 5 special type of binary tree node stores one Comparable data item left subtree (edge) is "less than" right subtree (edge) is "greater than"
Background image of page 6
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 7 How many different binary search How many different binary search trees can store 1 2 3 4 5 6? trees can store 1 2 3 4 5 6? 4 6 1 2 5 3 Full, Complete,  or Other? Which traversal returns items in sorted order?
Background image of page 7

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

View Full DocumentRight Arrow Icon
05/13/09 ©2004 Deb Deppeler. Some content based on work by Susan Horwitz ©2003. Used by permission. 8 How many different binary search How many different binary search trees can store 1 2 3 4 5 6?
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/17/2011 for the course CS 367 taught by Professor Marvinsolomon during the Spring '08 term at University of Wisconsin.

Page1 / 31

Lecture21 - Midterm 2 Stats 90-100 80-89 70-79 60-69 50-59...

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

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