![Abstract data types / Binomial heap / Fibonacci heap / Heap / Amortized analysis / Queue / Data structures / Priority queues / Weak heap / Shadow heap Abstract data types / Binomial heap / Fibonacci heap / Heap / Amortized analysis / Queue / Data structures / Priority queues / Weak heap / Shadow heap](https://www.pdfsearch.io/img/201c853b593eb83907035678570f44c2.jpg) 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 | | 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.Add to Reading ListSource URL: www-tcs.cs.uni-sb.deDownload Document from Source Website File Size: 112,13 KBShare Document on Facebook
|