Types of binary tree

There are two types of binary tree :
1.full binary tree
2.complete binary tree


FULL BINARY TREE

A full binary tree which is also called as proper binary tree or 2-tree is a tree in which all the node other than the leaves has exact two children.

COMPLETE BINARY TREE


A complete  binary tree is defined as if all levels are completely filled except possibly the last level has all keys as left as possible.

--> last level has no child is called complete binary tree.

Thank you viewers .
This is published by soumy Sinha..
If you have doubt then pls ask in comment box ..
If u like then pls share ,and subscribe ..

Comments

Popular posts from this blog

Introduction of Digital computer

INTRODUCTION OF DBMS

Introduction to cache memory