Tree by adeel

Topic:- Tree

Present by :- M-AdeelIncs:- Sir AKR

What is Tree

Not Siblings

Siblings Siblings

Siblings

TERMINOLOGY

Parent

Child Child

ChildChild ChildChild

Height of tree 2

1

2 2

1

2 2

STAR TOPOLOGY BUT IT IS TREE.

BUS TOPOLOGY BUT IT IS ALSO TREE.

Binary tree

A binary tree is one in which each node has at most two sub node.

A node can have just one but it can't have more than two.

Example/Application of Binary tree

m-array tree

A rooted tree is called an m-array tree if every internal vertex has no more than m children. .

An m-array tree with m = 2 is called a binary tree

Child of

sub node

Child

of

sub

node

Child

of

sub

node

Child

of

sub

node

Child of

sub node

Child of

sub node

Child of

sub node

Sub node

Sub node

Sub node

node

Child of

sub node

Child of

sub node

Sub tree