Basic definitions of binary tree
Binary Tree is defined as a tree data structure where each node has at most 2 children. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.
Full binary tree
A tree where every node (except for the leaves) has 2 branches is called a full binary tree.
Perfect binary tree
A tree where all interior nodes have two branches and all nodes with 0 branches (leaf nodes) are at the same level or have the same depth is called a perfect binary tree.
Complete binary tree
A binary tree which is completely filled—except potentially the bottom level, which is filled from left to right—is called a complete binary tree.
Similar binary tree
Two binary trees are considered the same if they are structurally identical and the nodes have the same value.
Equal binary tree
Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
Topic:-Basic definitions of binary tree
Submitted by:-
Gagandeep
Roll no. 22101145
Btech(CSE)Sem-3
Submitted to:-
Mr.Balwinder Singh