Chapter 8, Problem 42CRP

Explanation of Solution

Tree structure to store the genealogical history of a family:

The tree structure to store the genealogical history of a family is shown below:

The general structure for normal linked list and the genealogical

Each node in the linked list is represented by the

Then each node in the linked structure of genealogical is represented by the below ways

Operations performed by the given tree:

The operation performed by the given tree are insertion and searching operation.

Pointers associated with each node by using linked structure:

In the linked structure, the pointers associated with each node is given below:

• Parent pointer
• Spouse pointer
• Left child pointer
• Right child pointer
• Sibling pointer

The general linked list structure for pointers associated with each node is given below

Procedure to perform the above linked structure:

Procedure InsertOperation(Tree, data)

  if(Tree is None)

    set the root pointer to a new node containing value;

    Tree...