Page 206 - DCAP407_DATA_STRUCTURE

Kumar Vishal, Lovely Professional University Unit 11: Introduction to Binary Trees

Unit 11: Introduction to Binary Trees

CONTENTS
Objectives

Introduction
11.1 Types of Binary Trees
11.2 Storage Representation of Binary Tree
11.3 Overview of Threaded Binary Trees
11.4 Summary
11.5 Keywords

11.6 Self Assessment
11.7 Review Questions
11.8 Further Readings
Objectives

After studying this unit, you will be able to:
• Discuss the different types of binary trees
• Explain the storage representation of binary tree
• Explain linked representation of binary tree in detail

• Discuss the sequential representation of binary tree
• Provide an overview of threaded binary trees
Introduction
A binary tree is an important data structure providing hierarchical representation of data in the
memory. Each node in a binary tree can have a maximum of two branches. The binary tree is
represented with a root node, which consists of two sub-trees at the left and right side of the root node.
The two sub-trees are called as the left sub-tree and right sub-tree respectively. The nodes in the general
tree can have any number of children, whereas, the nodes in the binary tree can have a maximum of
two children.
We can define a binary tree as a set of nodes which is either empty or contains a root and two disjoined
right sub-tree and left sub-tree.

LOVELY PROFESSIONAL UNIVERSITY 199