0% found this document useful (0 votes)

16 views57 pages

mahi-trees

The document discusses the concepts of stacks, queues, and tree data structures, focusing on how to efficiently reach a specific number within these structures. It covers tree terminologies, types of binary trees, their representation using arrays and linked lists, and various tree traversal methods. Additionally, it presents problem statements related to finding maximum elements and total nodes in a binary tree.

Uploaded by

Palak Agarwal

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PPTX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

16 views57 pages

mahi-trees

Uploaded by

Palak Agarwal

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PPTX, PDF, TXT or read online on Scribd

You are on page 1/ 57

PREVIOUS SESSION

STACKS AND QUEUES

PROBLEM SOLVING ON STACKS AND QUEUES

INTRODUCTION

HOW TO REACH THE NUMBER 7 WHEN IT IS AN ARRAY DATASTRUCTURE ?

0 1 2 3 4 5 6 7

1 2 3 4 5 6 7 8
INTRODUCTION

HOW TO REACH THE NUMBER 7 WHEN IT IS AN ARRAY DATASTRUCTURE ?

0 1 2 3 4 5 6 7

1 2 3 4 5 6 7 8
INTRODUCTION

HOW TO REACH THE NUMBER 7 WHEN IT IS AN ARRAY DATASTRUCTURE ?

0 1 2 3 4 5 6 7

1 2 3 4 5 6 7 8
INTRODUCTION

HOW TO REACH THE NUMBER 7 WHEN IT IS AN ARRAY DATASTRUCTURE ?

0 1 2 3 4 5 6 7

1 2 3 4 5 6 7 8
INTRODUCTION

HOW TO REACH THE NUMBER 7 WHEN IT IS AN ARRAY DATASTRUCTURE ?

0 1 2 3 4 5 6 7

1 2 3 4 5 6 7 8
INTRODUCTION

HOW TO REACH THE NUMBER 7 WHEN IT IS AN ARRAY DATASTRUCTURE ?

0 1 2 3 4 5 6 7

1 2 3 4 5 6 7 8
INTRODUCTION

HOW TO REACH THE NUMBER 7 WHEN IT IS AN ARRAY DATASTRUCTURE ?

0 1 2 3 4 5 6 7

1 2 3 4 5 6 7 8
INTRODUCTION

HOW TO REACH THE NUMBER 7 WHEN IT IS AN ARRAY DATASTRUCTURE ?

0 1 2 3 4 5 6 7

1 2 3 4 5 6 7 8
INTRODUCTION

HOW TO REACH THE NUMBER 7 WHEN IT IS AN ARRAY DATASTRUCTURE ?

0 1 2 3 4 5 6 7

1 2 3 4 5 6 7 8

CAN I MAKE USE OF ANY DATASTRUCTURE WHICH REACHES THE NUMBER 7 IN LESS TIME ?
INTRODUCTION

YES, BY USING
HIERARCHICAL DATA
STRUCTURE

TREES
INTRODUCTION

YES, BY USING
HIERARCHICAL DATA
STRUCTURE

TREES
INTRODUCTION

HOW TO REACH THE NUMBER 7 WHEN IT IS TREE DATA STRUCTURE ?

INTRODUCTION

HOW TO REACH THE NUMBER 7 WHEN IT IS TREE DATA STRUCTURE ?

INTRODUCTION

HOW TO REACH THE NUMBER 7 WHEN IT IS TREE DATA STRUCTURE ?

AGENDA

TREE TERMINOLOGIES

APPLICATIONS OF TREE

BINARY TREE AND ITS

TRAVERSALS
TREE TERMINOLOGIES

ROOT

NODE
SIBLINGS

EDGE

PARENT NODE / INTERNAL NODE

CHILD OF 2
LEAF NODES /
EXTERNAL NODES
GUESS THE NODE

NODE DEGREE - ?
LEVEL - ?

DEPTH - ?

HEIGHT - ?
TREE TERMINOLOGIES

LEVEL 0

HEIGHT = 2 DEPTH = 1

LEVEL
1
DEPTH = 2
NODE DEGREE = 3

LEVEL 2
HEIGHT = 0 NODE DEGREE = 0

LEVEL 3

HEIGHT OF TREE = 3
APPLICATIONS OF TREES

Implementing the hierarchical structures in

computer systems like directory and
filesystem
Decision making in game application

Implementing the navigation structure of a

website
Parsing of expressions and statements in
programming language compilers
Path-finding algorithm to implement in AI,
robotics and video games applications
BINARY TREE

A tree whose elements have at most 2 children is called a binary tree.

BINARY TREE

A tree whose elements have at most 2 children is called a binary tree.

TYPES OF BINARY TREE :

• Full Binary Tree

• Complete Binary Tree
• Perfect Binary Tree
• Skewed Binary Tree
• Degenerate or Pathological Tree
• Balanced Binary Tree
TYPES OF BINARY TREE

Full Binary Tree Perfect Binary Tree Complete Binary Tree

TYPES OF BINARY TREE

Degenerate or Skewed Binary Tree Balanced Binary Tree

pathological Tree
REPRESENTATION OF BINARY TREE

BINARY TREE USING ARRAY :

BINARY TREE

ARRAY LINKED LIST

REPRESENTATION OF BINARY TREE

BINARY TREE USING ARRAY :

0 1 2 3 4
1
1 2 3 4 5

PARENT
REPRESENTATION OF BINARY TREE

BINARY TREE USING ARRAY :

LEFTCHILD = (2*i)+1

0 1 2 3 4
1
1 2 3 4 5

PARENT LEFTCHILD 2
REPRESENTATION OF BINARY TREE

BINARY TREE USING ARRAY :

LEFTCHILD = (2*i)+1
RIGHTCHILD = (2*i)+2

0 1 2 3 4
1
1 2 3 4 5

PARENT LEFTCHILDRIGHTCHILD 2 3
REPRESENTATION OF BINARY TREE

BINARY TREE USING ARRAY :

0 1 2 3 4
1
1 2 3 4 5

PARENT LEFTCHILDRIGHTCHILD 2 3

PARENT 4
REPRESENTATION OF BINARY TREE

BINARY TREE USING ARRAY :

LEFTCHILD = (2*i)+1

0 1 2 3 4
1
1 2 3 4 5

PARENT LEFTCHILDRIGHTCHILD 2 3

PARENT 4 5
LEFTCHILD
REPRESENTATION OF BINARY TREE

BINARY TREE USING ARRAY :

LEFTCHILD = (2*i)+1
RIGHTCHILD = (2*i)+2

0 1 2 3 4
1
1 2 3 4 5

PARENT LEFTCHILDRIGHTCHILD 2 3

PARENT 4 5
LEFTCHILDRIGHTCHILD
REPRESENTATION OF BINARY TREE

BINARY TREE USING LINKED LIST :

BINARY TREE

ARRAY LINKED LIST

left data right

REPRESENTATION OF BINARY TREE

BINARY TREE USING LINKED LIST :

*left 1 *righ
t

left data right

REPRESENTATION OF BINARY TREE

BINARY TREE USING LINKED LIST :

*left 1 *righ
t

*left 2 *righ
t

left data right

REPRESENTATION OF BINARY TREE

BINARY TREE USING LINKED LIST :

*left 1 *righ
t

left 2 righ left 3 righ

t t

left data right

REPRESENTATION OF BINARY TREE

BINARY TREE USING LINKED LIST :

*left 1 *righ
t

left 2 righ left 3 righ

t t

left 4 righ left data right

t
REPRESENTATION OF BINARY TREE

BINARY TREE USING LINKED LIST :

*left 1 *righ
t

left 2 righ left 3 righ

t t

left 4 righ left 5 righ left data right

t t
LET’S CREATE A BINARY TREE
TRAVERSING THROUGH BINARY TREE

Tree Traversal