March 2013
Intermediate to advanced
416 pages
9h 41m
English
Graphs
Contents
In our exploration of data structures, we have examined ways in which items may be linked together. Each node in a list, stack or queue has a maximum of one successor and one predecessor; a node in a binary tree may be linked to a maximum of two children. These structures demonstrate a ‘hierarchy’ whose members are ordered by value (Figure 13.1) in the case of a sequential list and a binary search tree ...