04-trees

Unit 4: Tree data structures

This unit covers tree data structures and their use:

• Binary search trees
• Sets and maps (in library)
• Heaps
• Priority queues (in library)

Prerequisites

• Unit 1: Complexity

Practice problems

Easy

• UVa 11849 - CD (uses set)
• UVa 10226 - Hardwood Species (uses map, input a bit tricky)
• UVa 10954 - Add All (uses priority_queue, make sure to use long long because numbers get large)

Medium

• UVa 11572 - Unique Snowflakes (uses map)
• UVa 11136 - Hoax or what (uses multiset or priority_queue)
• UVa 978 - Lemmings Battle! (uses priority_queue)

Hard

• UVa 10029 - Edit Step Ladders (uses map)