Data Structure: Unit III: Trees

Types of Binary Tree

ADT Data Structure

Home | All Subjects | CSE Department | Data Structure
Next >>

A full binary tree is a tree in which every node has zero or two children.

Types of Binary Tree

Full Binary Tree

•. A full binary tree is a tree in which every node has zero or two children.

• In other words, the full binary tree is a binary tree in which all the nodes have two children except the leaf node.

Complete Binary Tree

• The complete binary tree is a binary in which all the levels are completely filled except the last level which is filled from left.

• There are two points to be remembered

1) The leftmost side of the leaf node must always be filled first.

2) It is not necessary for the last leaf node to have right sibling.

• Note that in above representation, Tree 1 is a complete binary tree in which all the levels are completely filled, whereas Tree 2 is also a complete binary tree in which the last level is filled from left to right but it is incompletely filled.

Difference between complete binary tree and full binary tree



Left and Right Skewed Trees

The tree in which each node is attached as a left child of parent node then it is left skewed tree. The tree in which each node is attached as a right child of parent node then it is called right skewed tree.


Data Structure: Unit III: Trees : Tag: : ADT Data Structure - Types of Binary Tree

Home | All Subjects | CSE Department | UNIT: Data Structure
Next >>

Related Topics


Trees ADT - Definition, Example Operations | Data Structure

Basic Terminologies in Trees - ADT Data Structure

Binary Tree ADT - Definition, Syntax, Example Operations | Data Structure

Types of Binary Tree - ADT Data Structure

Representation of Tree - ADT Data Structure

Tree Traversal - Definition, Algorithm with Example C Programs | ADT Data Structure

Expression Trees - Definition, Algorithm with Example C Programs | ADT Data Structure

Applications of Trees - ADT Data Structure

Binary Search Tree ADT - Operations, Algorithm with Example C Programs | Data Structure

Threaded Binary Trees - Operations, Structure, Algorithm with Example C Programs, Advantages, Disadvantage | ADT Data Structure

Constructing Binary Search Tree from Traversals - ADT Data Structure

C Programming Examples on Binary Trees - ADT Data Structure

AVL Trees - Definition, Theorem, Algorithm with Example C Programs | ADT Data Structure

Binary Heap - Definition, Types, Algorithm with Example C Programs | ADT Data Structure

Priority Queue Heaps - Operations, Algorithm with Example C Programs | Trees ADT | Data Structure

Related Subjects


Data Structure

Data Structure

CS3301 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation