June 2017
Beginner
1296 pages
69h 23m
English
Dynamic data structures (p. 847) can grow and shrink at execution time.
Linked lists (p. 847) are collections of data items “linked up in a chain”—insertions and deletions can be made anywhere in a linked list.
Stacks (p. 847) are important in compilers and operating systems—insertions and deletions are made only at the top (p. 847) of a stack.
In a queue, insertions are made at the tail (p. 847) and deletions are made from the head (p. 847).
Binary trees (p. 847) facilitate high-speed searching and sorting, eliminating duplicate data items efficiently, representing file-system directories and compiling expressions into machine language.
A self-referential class ...