12
Binary Trees
Trees
Contents
- Binary tree structures
- Search trees
- Tree operations—build, search, traverse, delete items
- A Tree class
- Threaded trees
- Expression trees
- Heaps
12.1 INTRODUCTION
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 ...
Get Introducing Data Structures with Java now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.