'Return treesearch' presentation slideshows

2IL65 Algorithms

2IL65 Algorithms. Fall 2013 Lecture 6: Binary Search Trees. Dynamic Sets. Dynamic sets. Dynamic sets Sets that can grow, shrink, or otherwise change over time. Two types of operations: queries return information about the set modifying operations change the set Common queries

580 views • 45 slides

Sorting

582 views • 43 slides

2IL50 Data Structures

2IL50 Data Structures. Spring 2014 Lecture 7: Binary Search Trees. Dynamic Sets. Dynamic sets. Dynamic sets Sets that can grow, shrink, or otherwise change over time. Two types of operations: queries return information about the set modifying operations change the set Common queries

648 views • 43 slides

Binary Search Trees

Binary Search Trees. Dynamic Sets. Want a data structure for dynamic sets Elements have a key and satellite data Dynamic sets support queries such as: Search(S, k), Minimum(S), Maximum(S), Successor(S, x), Predecessor(S, x) They may also support modifying operations like:

410 views • 28 slides