DATA

STRUCTURES

MAHESH GOYANI
MAHATMA GANDHI INSTITUE OF TECHNICAL EDUCATION & RESEARCH CENTER
mgoyani@rediffmail.com

(C) GOYANI MAHESH 1

 STRICT
BINARY TREE

(C) GOYANI MAHESH 2

TERMINOLOGY

 If every non-leaf node in a binary tree has non-empty left and right subtrees, the
tree is termed a strictly binary tree.

 Or we can say that a tree is strict binary tree if all nodes have degree either 0 or 2

 A Strictly Binary tree with n level contains at most 2n+1 Terminal Nodes

 It is also known as 2-Tree or Extended Binary Tree or Expression Tree.

B C

D E J F

G K H I

(C) GOYANI MAHESH 3

APPLICATION

E=v+u/x*y-z
-
Step 4
z +

Step 3 v *

Step 2
/ y
Step 1

u x
(C) GOYANI MAHESH 4