Binary Tree Representation
A binary tree can be represented using two ways:
- Array representation
- Linked List representation
Let us consider the following representation of the binary tree:
Array representation
To represent a binary tree of depth ‘n’ using array representation a one-dimensional array with a maximum size of 2n + 1 is used.
Linked list representation
A double-linked list is used to represent a binary tree. Every node comprises three fields. The first field is for storing the left child address, the second is for storing actual data and the third is for storing the right child address.
Reference