 This process continues down to the bottom layer, which is the actual list.A binary tree can be seen as a type of linked list where the elements are themselves linked lists of the same nature.The result is that each node may include a reference to the first node of one or two other linked lists, which, together with their contents, form the subtrees below that node.