Introduction to linked list based binary trees

We now know what a tree data structure looks like on paper and its different types and properties. However, to use this data structure, we need a way to represent it using a programming language in computer memory. This representation needs to be easy to use and complete.

On closer inspection, we can see a binary tree as a two-dimensional linked list. Instead of just having just one next section, what if the linked list had two next sections.