What is a Binary Tree?
An introduction to binary trees and different types of binary trees
Introduction
A binary tree is a tree in which each node has between 0-2 children. They’re called the left and right children of the node. The figure below shows what a Binary Tree looks like.
Types of Binary Trees
Complete Binary Trees
A complete binary tree is a binary tree in which all the levels of the tree are fully filled, except for perhaps the last level which can be filled from left to right.
Not a complete Binary Tree
A Complete Binary Tree
Full Binary Trees
- In a full or ‘proper’ binary tree, every node has 0 or 2 children. No node can have 1 child.
- The total number of nodes in a full binary tree of height ‘h’ can be expressed as:
...
Level up your interview prep. Join Educative to access 70+ hands-on prep courses.