Data Structures using C, 2nd Edition

7

Trees

CHAPTER OUTLINE

7.1 Introduction

7.2 Basic Terminology

7.3 Binary Trees

7.4 Representation of a Binary Tree

7.5 Types of Binary Trees

7.6 Weighted Binary Trees and Huffman Algorithm

7.7 Dynamic Dictionary Coding

7.1 INTRODUCTION

There are situations where the nature of data is specific and cannot be represented by linear or sequential data structures. For example, as shown in Figure 7.1 hierarchical data such as ‘types of computers’ is non-linear by nature.

Fig. 7.1 Hierarchical data

Situations such as roles performed by an entity, options available for performing a task, parent–child relationships demand non-linear representation. ...