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 work with and able to capture every node and connection in the tree.

On closer inspection, we can see a binary tree as a two-dimensional linked list. Instead of having just one next section (as in a singly linked list, where each node points to the one node that follows it), what if the linked list had two next sections.