lec10 - Outline A short summary: symbol table Skip-list...

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

View Full Document Right Arrow Icon
Outline A short summary: symbol table Skip-list Expected height of a binary tree (by inser- tion of a random order) O (log n ). Some other useful tricks Move-to-front heuristic Order by frequency Interpolation search Splay tree Data structure applications Lecture 10, Other Data Structures p. 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
A Short Summary: List Array Sorted Array Find O ( n ) O ( n ) O (log n ) p-Sch O ( n ) O ( n ) O (log n ) Insert O (1) O ( n ) O ( n ) Delete O ( n ) O ( n ) O ( n ) AVL-Tree B-Tree Find O (log n ) O ( b log n ) p-Sch O (log n ) O ( b log n ) Insert O (log n ) O ( b log b n ) Delete O (log n ) O ( b log b n ) AVL Tree: Rotations B-Tree: Splitting Lecture 10, Other Data Structures p. 2
Background image of page 2
Skip List: Definition and Performance All nodes are sorted in increasing order Each node has multiple links. The number of links varies for each node. The i th link links to the next node with at least i links Θ(log n ) expected time for all operations (insert, delete, find, p-search) Lecture 10, Other Data Structures p. 3
Background image of page 3

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

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

Page1 / 6

lec10 - Outline A short summary: symbol table Skip-list...

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

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