Types of binary trees in data structures

Types of binary trees in data structures

Types of binary tree

• Strict Binary Tree
• A binary tree in which every node has either 0 or two children is called strict binary tree.

• Full Binary Tree
• A binary tree in which every node other than the leaves has exactly two children is called full binary tree.

• Complete Binary Tree
• A binary tree in which all the levels except the last one are completely filled with nodes and the last level is filled with nodes from left to right.

**********

Go to Binary Tree page 

Go to Data structures main page  

Go to Tree Data Structure home page

strict binary tree, full binary tree, complete binary tree, definition of full binary tree, example of full binary tree