Chapter 17, Problem 2RE

Explanation of Solution

Tree:

• A data structure that is present in the hierarchical form and is composed of nodes.
• Each of the node will be having a sequence of child nodes and also one of the node is considered to be a root node.

Recursive algorithm to find maximum number of siblings in a tree:

The children present in the tree are considered as the siblings of each other.

If a node n1 contains three children n2, n3 and n4 and these three nodes are considered as the siblings.

Algorithm:

//recursive function use to find siblings of any particular node

public int sib()

{

    //declare and initialize variable

    int sum=0;

    //use for loop to find the length of siblings

    for(Node child :children)

    {

        //add all siblings

        sum=sum+child...