Family Tree using GLL

So, in this series of blogs, now, coming to the course project, we have implementation of Family tree using Generalized Linked List So, what actually is a Generalized Linked List or a GLL? Firstly, we need to know what a general list is. A generalized list ‘ A’ is defined as a finite sequence of elements (or data containers), where ‘A’ is either an atom or a list. The elements ‘ A i ’, where, 0 ≤ i ≤ n-1, are said to be the sub lists of ‘A’ , that are not atoms of ‘ A’ . Using this definition further in our programming domain makes this concept to be called as Generalised Linked List, a further extension to the concept of Linked Lists. Linked List was constrained in only one direct with one ‘next’ pointer, thus making its operations or applications limited. In GLL, there’s relaxation on the restriction that the list is linear. So, a basic structure if the GLL consists a ‘next’ pointer, as well as a ‘down’ pointer, which enables the former Linked List to crea...