March 2013
Intermediate to advanced
416 pages
9h 41m
English
Trees
Contents
Each node in a singly linked list, stack or queue is linked to just one another, so that each points to its successor (in the doubly linked list an item points to its predecessor too). In the structure considered in this chapter, each node can be linked to one or more others. In the case of a ‘binary tree’, each node may be linked to a maximum of two others: A node has two links to its ‘left’ and ‘right’ children, it being their ‘parent’. Each child can ...