TREES

USING DATA
STRUCTURES

GROUP MEMBERS

AILANI SAGAR

RAMRAKHIANI ASHISH
PARMAR JATIN
GUWALANI JAIKUMAR
KUKREJA YASH
WANI PURSHOTTAM
MORE ABHISHEK

DEFINITION
A tree is a non-linear data structure
that consists of a root node and many
levels of additional nodes that form a
hierarchy. A tree can be empty with no
nodes called the null or empty tree or
a tree is a structure consisting of one
node called the root and one or more
sub trees.
VERTICE
NODES
S

Tree

FOR EG.
OPERATING SYSTEM OF A COMPUTER ORGANIZES
FILES INTO DIRECTORIES AND SUB-DIRECTORIES.
DIRECTORIES ARE ALSO REFERED AS
FOLDERS.OPERATING SYSTEM ORGANIZES
FOLDERS AND FILES USING A TREE STRUCTURE.
A FOLDER CONTAINS OTHER FOLDERS(SUBDIRECTORIES AND FILES)
THIS CAN BE VIEWED AS TREE DRAWN BELOW..
THE ROOT IS DESKTOP.

DESKTO
P

MY
COMPUTER

A DRIVE

NETWORK
NEIGHBOURHOO
D

C DRIVE

WINDOWS

PROGRAM
FILES

TERMINOLOGIE
ROOT
SNODE :
ROOT
NODE

ROOT NODE IS THE MOTHER

NODE OF A TREE STRUCTURE. THIS
NODE DOES NOT HAVE ANY
PARENT.

LEAF NODE :
LEAF NODE IS A TERMINAL
NODE OF A TREE. IT DOES NOT
HAVE ANY NODES CONNECTED TO
IT

LEAF
NODES

Tree
DEGREE OF A NODE :
THE NUMBER OF SUB
TREES
OF A NODE IS
CALLED ITS DEGREE.

DEGREE OF
NODE IS 1

DEGREE OF A
TREE : DEGREE OF
NODE IS 2

C
E

D
F

DEGREE OF
TREE IS 3
THE DEGREE OF A TREE IS THE
MAXIMUM DEGREE OF THE NODES IN DEGREE OF
THE TREE.
NODE IS 3

 LEVEL :
LEVEL IS A RANK OF TREE HIERARCHY. THE WHOLE TREE
STRUCTURE IS LEVELED.LEVEL OF ROOT NODE IS 0.

LEVEL OF
NODE IS
0

F
LEVEL OF
NODE IS

LEVEL OF
NODE IS
1

 PARENT NODE :
IT IS A NODE HAVING OTHER NODES CONNECTED TO IT.
THESE NODES ARE CALLED THE CHILDREN OF PARENT
NODE.

A IS
PARENT
B IS
PARENT
ALL E
OF OF
D AND
NODES

 HEIGHT OF A TREE :
THE HIGHEST NO OF NODES THAT IS POSSIBLE IN A
WAY STARTING FROM THE FIRST NODE TO A LEAF
NODE IS CALLED THE HEIGHT OF A TREE.

LEVEL 0

LEVEL
1

HEIGHT
OF
TREE
LEVEL 2 IS
4
LEVEL 3

 PATH :
A SEQUENCE OF CONSECUTIVE EDGES IS
CALLED A PATH.

PATH
FROM A
TO G

A
PATH
FROM A
TO E

 FOREST :
FOREST IS A SET OF SEVERAL TREES THAT ARE NOT
LINKED TO EACH OTHER.

SIBLINGS :
CHILDREN OF THE SAME PARENT ARE CALLED
SIBLINGS.

B AND C ARE
SIBLINGS.

D AND E ARE
B
SIBLINGS.
D

F AND
G ARE
SIBLING
S.

 DESCENDENTS :
THE CHILD, GRAND CHILD OR ANY CHILD DOWN TO
HIERARCHY IS CALLED DESCENDENTS.

THEREFORE B,
C, D, E, F, G
ARE
DESCENDENTS

B, C AND D
ARE CHILDS OF
A
E, F AND G
ARE
GRAND CHILDS
OF
A
B

 ANCESTORS :
THE PARENT, GRAND FATHER, THE GREAT GRAND
FATHER OF A NODE ARE CALLED ANCESTORS.

A IS GRAND
PARENT OF
D, E, F,G

A IS PARENT
OF B AND C

D
A IS

ANCESTORS OF ALL THE

NODES.

TYPES OF
TREES
GENERAL
TREE.

BINARY TREE.
STRICTLY BINARY TREE.
COMPLETE BINARY TREE.
EXTENDED BINARY TREE.
EXPRESSION TREE.
SKEWED TREE.
BINARY SEARCH TREE.

 GENERAL TREE :
A GENERAL TREE IS A TYPE OF TREE THAT
DOESNOT HAVE ANY RESTRICTION ON IT. IT CAN
HAVE ANY NO. OF CHILD NODES.

A HAS THREE
CHILDS B, C
AND D

THEREFORE, THERE ARE NO

RESTRICTIONS ON ITS NO. OF CHILD
NODES.

 BINARY TREE :

THE TREE WHICH HAS A RESTRICTION OF HAVING

ONLY 0, 1 OR 2 CHILD NODES IS CALLED A BINARY
TREE.
A HAS

RESTRICTION
OF HAVING
NOT MORE
THAN TWO
CHILD NODES.

THEREFORE, IT IS A
BINARY TREE.

 STRICTLY BINARY TREE :

THE BINARY TREE IN WHICH THE SUBTREE STARTS
FROM WHERE THE NODE IS ENDED.

IT IS A

STRICTLY
BINARY
TREE.

 COMPLETE BINARY TREE :

A BINARY TREE IN WHICH ALL THE LEAF NODES END AT
THE SAME LEVEL IS CALLED COMPLETE BINARY TREE.

AS ALL THE
NODES ARE
COMPLETED
ON SAME
LEVEL
E

IT IS A COMPLETE BINARY TREE

 EXTENDED BINARY TREE :

THE BINARY TREE IN WHICH ALL THE LEAF NODES ARE
EXTENDED BY PUTTING A BOX.

A
B

IT IS A EXTENDED BINARY TREE

 EXPRESSION TREE :
WHEN ANY EXPRESSION IS REPRESENTED IS IN THE FORM
OF THE TREE IS CALLED EXPRESSION TREE.
FOR EG: (A+B)*(C+D)

IT IS A EXPRESSION TREE

 SKEWED TREE :
THE BINARY TREE WHICH IS INCLINED ON ANY ONE
SLIDE EITHER ON THE LEFT SIDE OR RIGHT SIDE IS
CALLED SKEWED TREE

IT IS
LEFT
SKEWE
D
C
TREE
F

IT IS
RIGHT
SKEWE
D
TREE
F

 BINARY SEARCH TREE :

THE BINARY TREE IN WHICH CERTAIN RULES AND
REGULATION ARE FOLLOWED IS KNOWN IS BINARY
SEARCH TREE.
IN THIS TREE THE FIRST CHARACTER IS TAKEN AS
ROOT NODE, THE CHARACTER SMALLER THAN ROOT
NODE IS GIVEN THE LEFT POSITION FROM THE ROOT
AND THE CHARACTER WHICH IS GREATER THAN
ROOT NODE IS GIVEN THE RIGHT POSITION FROM
THE NODE.
FOR EG. 10, 20, 05, 15, 25, 07, 03

SO, LETS SEE HOW IT

WORKS.

10, 20, 05, 15, 25,

07, 03
10

05

03

20

07

15

25

 ARRAY REPRESENTATION OF
TREE

BINARY

0
A

1
B

A
0

B
1

D
2

E
3

F
4

G
5

 LINK LIST REPRESENTATION OF

BINARY TREE