Readings and References
Reading
Trees
CSE 326 Data Structures Lecture 6
> Chapter 4.1-4.3,
Trees - Lecture 6
2
Why Do We Need Trees?
Lists, Stacks, and Queues are linear data structures Information
CSE 326 Winter 2008 Assignment 1 Due 1/16/08
For all algorithm and data structure design problems please provide elegant pseudocode and an adequate explanation of your methods. If is often helpful to
CSE 326 Winter 2008 Assignment 3 Due 2/1/08, Friday
For all algorithm and data structure design problems please provide elegant pseudocode and an adequate explanation of your methods. If is often help
CSE 326 Winter 2008 Assignment 5 Due 2/27/2008, Wednesday
For all algorithm and data structure design problems please provide elegant pseudocode and an adequate explanation of your methods. If is ofte
CSE 326 Winter 2008 Assignment 2 Due 1/23/08
For all algorithm and data structure design problems please provide elegant pseudocode and an adequate explanation of your methods. If is often helpful to
Readings and References
Reading
AVL Trees
CSE 326 Data Structures Lecture 7
> Section 4.4,
AVL Trees - Lecture 7
2
Binary Search Tree - Best Time
All BST operations are O(h), where h is tree height
Mathematical Background
Today, we will review:
Fundamentals
CSE 326 Data Structures Lecture 2
> Logs and exponents and series > Asymptotics and order of magnitude notation > Solving recursive equatio
Need for Multi-way Search B-Trees
CSE 326 Data Structures Lecture 10 In very large databases nodes may reside on disk. The unit of disk access is a page, 1k, 2k or more bytes.
k1 . ki-1 ki . kM-1
B-Tr
Readings and References
Reading
Splay Trees
CSE 326 Data Structures Lecture 8
> Sections 4.5-4.7
Splay Trees - Lecture 8
2
Self adjustment for better living
Ordinary binary search trees have no bala
Plan
Look at three sorting algorithms in detail
Sorting Introduction
CSE 326 Data Structures Lecture 3
> Insertion Sort > Mergesort > Quicksort
Sort Intro - Lecture 3
2
Sorting
Input
> an array A of
CSE 326 Winter 2008 Assignment 4 Due 2/8/08
For all algorithm and data structure design problems please provide elegant pseudocode and an adequate explanation of your methods. If is often helpful to i