8_split_Introduction to Algorithms 2nd Edition

8_split_Introduction to Algorithms 2nd Edition - 331 15.3...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Contents vii 12 Binary Search Trees 253 12.1 What is a binary search tree? 253 12. 2 Queryinga binary search tree 256 12.3 Insertion and deletion 261 ± 12. 4 Randomly built binary search trees 26 5 13 Red-Black Trees 273 13.1 Properties of red-black trees 273 13.2 Rotations 277 13.3 Insertion 280 13.4 Deletion 288 14 Augmenting Data Structures 302 14.1 Dynamic order statistics 302 14.2 How to augment a data structure 308 14.3 Interval trees 311 IV Advanced Design and Analysis Techniques Introduction 321 15 Dynamic Programming 323 15.1 Assembly-line scheduling
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 331 15.3 Elements of dynamic programming 339 15.4 Longest common subsequence 350 15.5 Optimal binary search trees 356 16 Greedy Algorithms 370 16.1 An activity-selection problem 371 16.2 Elements of the greedy strategy 379 16.3 Huffman codes 385 16.4 Theoretical foundations for greedy methods 393 16.5 A task-scheduling problem 399 17 Amortized Analysis 405 17.1 Aggregate analysis 406 17.2 The accounting method 410 17.3 The potential method 412 17.4 Dynamic tables 416...
View Full Document

Ask a homework question - tutors are online