<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2016-03-09 08:07:30Abstract data types Binomial heap Fibonacci heap Heap Amortized analysis Queue Data structures Priority queues Weak heap Shadow heap |
Add to Reading List |
| First Page | Document Content | |
|---|---|---|
Date: 2016-03-09 08:07:30Abstract data types Binomial heap Fibonacci heap Heap Amortized analysis Queue Data structures Priority queues Weak heap Shadow heap |
Add to Reading List |
Algorithms and Data Structures Winter TermExercises for Unit 16 & 17 1. Show the following simple facts about a binomial tree of rank k. a) The tree has 2k nodes.
