next up previous
Next: 4.1.1 Definitions Up: 4. Binary Trees Previous: 4. Binary Trees

4.1 Introduction

Trees are very useful and important abstractions in Computer Science. They are ideally suited to representing hierarchical relationships among elements in a universe. Efficient implementations of abstract data types such as dictionaries and priority queues are invariably in terms of binary or general trees.