12-bst.pdf - Felix Xiaozhu Lin Lecture 12 Binary Search...

This preview shows page 1 - 6 out of 24 pages.

Felix Xiaozhu Lin Lecture 12: Binary Search Trees Textbook Reading: Chapter 12 (pp. 502 – 520) Slides Courtesy: Prof. Vijay Raghunathan
Image of page 1

Subscribe to view the full document.

Learning Objectives Recap: the concept of Binary Tree The idea & use of Binary Search Tree Quickly locate an item in sorted items The idea & use of List as Binary Tree Quickly locate the k-th item in a list ECE368: Data Structures (Fall 2015) 2
Image of page 2
Binary Search Tree (BST) Property: If x is a node, all nodes in left subtree of node x have Info < Info(x) and all nodes in right subtree of node x have Info >= Info(x) Perform in-order traversal 3 14 9 17 4 18 14 15 8 ECE368: Data Structures (Fall 2015)
Image of page 3

Subscribe to view the full document.