Scribd
Upload
53 views

Strict Binary Tree

A strict binary tree is a binary tree where every non-leaf node has exactly two children and all nodes have either 0 or 2 children. A strict binary tree with n levels can have up to 2n+1 terminal nodes. It is also known as a 2-tree, extended binary tree, or expression tree. Strict binary trees can be used to represent mathematical expressions by having operators as internal nodes and operands as leaf nodes.

Uploaded by

Akif Vohra
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPS, PDF, TXT or read online on Scribd
53 views

Strict Binary Tree

A strict binary tree is a binary tree where every non-leaf node has exactly two children and all nodes have either 0 or 2 children. A strict binary tree with n levels can have up to 2n+1 terminal nodes. It is also known as a 2-tree, extended binary tree, or expression tree. Strict binary trees can be used to represent mathematical expressions by having operators as internal nodes and operands as leaf nodes.

Uploaded by

Akif Vohra
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPS, PDF, TXT or read online on Scribd
You are on page 1/ 4

DATA

STRUCTURES

MAHESH GOYANI
MAHATMA GANDHI INSTITUE OF TECHNICAL EDUCATION & RESEARCH CENTER
[email protected]

(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

You might also like