FinalReview - Final Review Dr. Yingwu Zhu Goals Use...

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

View Full Document Right Arrow Icon
Final Review Dr. Yingwu Zhu
Background image of page 1

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

View Full DocumentRight Arrow Icon
Goals Use appropriate data structures to solve real- world problems E.g., use stack to implement non-recursive BST traversal, use queue to implement BST level traversal, use stack to implement non-recursive quicksort use heaps to do heapsort, and priority queues Use appropriate algorithms to slove real-world problems Search algorithms Sorting algorithms
Background image of page 2
Goals Use Big-Oh notation to evaluate algorithm efficiency Understand ADTs including BST, Heap, Priority Queue, AVL trees Understand hashing Understand sorting algorithms
Background image of page 3

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

View Full DocumentRight Arrow Icon
ADTs Tree terminologies BST AVL Trees Heap Priority Queue
Background image of page 4
Trees Binary trees Complete trees Balanced trees Level Height
Background image of page 5

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

View Full DocumentRight Arrow Icon
BST Definition Recursive ADT Implementing a BST (recursive and non- recursive) Search Traversals (in-order, pre-order, post-order) Insertion Deletion Other operations: height, level, …
Background image of page 6
T(n) = ? Is BST balanced?
Background image of page 7

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

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

This note was uploaded on 03/01/2011 for the course CSSE 250 taught by Professor Dr.yingwuzhu during the Fall '11 term at UH Clear Lake.

Page1 / 24

FinalReview - Final Review Dr. Yingwu Zhu Goals Use...

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

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