Page 102 - DCAP605_ADVANCED_DATA_STRUCTURE_AND_ALGORITHMS

Unit 5: Trees
Mandeep Kaur, , Lovely Professional University

Unit 5: Trees Notes

CONTENTS

Objectives
Introduction
5.1 Concept of Tree
5.2 Binary Tree
5.2.1 Types of Binary Tree

5.2.2 Properties of a Binary Tree
5.3 Binary Representation
5.4 Implementation of a Binary Tree
5.5 Binary Tree Traversal

5.5.1 Order of Traversal of Binary Tree
5.5.2 Procedure for Inorder Traversal
5.6 Summary
5.7 Keywords
5.8 Self Assessment

5.9 Review Questions
5.10 Further Readings

Objectives

After studying this unit, you will be able to:
Discuss the concept of tree
Explain concept of binary tree

Know binary tree traversal
Introduction

While dealing with many problems in computer science, engineering and many other disciplines,
it is needed to impose a hierarchical structure on a collection of data items. For example, we need
to impose a hierarchical structure on a collection of data items while preparing organizational
charts and genealogies, to represent the syntactic structure of source programs in compilers. A
tree is a data structure that is used to model such a hierarchical structure on data items, hence
the study of tree as one of the data structures is important. This module discusses tree as a data
structure.

LOVELY PROFESSIONAL UNIVERSITY 97