There are two ways of representing a binary tree. The first is using a dynamic representation using pointers (node representation) as we did in the previous chapter. The second is using an array accessing the correct indexes to retrieve the values of the parent, left, and right children. The following diagram demonstrates the binary tree's different representations:
To access the nodes of a binary tree using a regular array, we can manipulate the index with the following behavior:
For any given node at position index:
- Its left child is located at 2 * index + 1 (if available)
- Its right child is located at ...
