Question

Write a program in Java that will accept input and display a person's family tree. This program needs to have a root person that branches off to parents and grandparents and be made so that you can add people.

Answer 1

This is the program in Java . I think, it would help you....

import javax.swing.*;

   import java.awt.*;

   import java.awt.event.*;

   import java.util.*;

/*

* @author      Amber Hisaw <[email protected]>

* @version     1.0

* @since       5-9-2015

* @purpose:    This class creates a binary tree that

*              holds strings and will add them to a

*              specified node.

*/

   public class FamilyTree

   {

      private class Node

      {

         String value;     // Value stored in node

         Node left, right; // Left and right child     

       

      /**

      Constructor for leaf nodes.

      @param val The value to store in the node.

      */

         Node(String val)

         {

            value = val;

            left = null;

            right = null;

         }  

       

      /**

      Constructor for non-leaf nodes.

      @param val The value to initialize the node.

      @param leftChild The link to the left child.

      @param rightChild The link to the right child.

      */

         Node(String val, Node leftChild, Node rightChild)

         {

            value = val;

            left = leftChild;

            right = rightChild;

         }

        }

    

   /**

    The BTreeDisplay class graphically displays trees

   in a JPanel. The JPanel is recursively partitioned

   into a top part dislaying the root, and two lower

   parts displaying the left and right subtrees.

   */

      private class BTreeDisplay extends JPanel

      {

      /**

      Constructor.

      @param tree The root of the binary

      tree to display.

      */

       

         BTreeDisplay(Node tree)

         {          

            setBorder(BorderFactory.createEtchedBorder());

            setLayout(new BorderLayout());

            if (tree != null)

            {         

               String value = String.valueOf(tree.value);

               int pos = SwingConstants.CENTER;

               JLabel rootLabel = new JLabel(value, pos);                        

               add(rootLabel, BorderLayout.NORTH);

               JPanel panel = new JPanel(new GridLayout(1, 2));

               panel.add(new BTreeDisplay(tree.left));

               panel.add(new BTreeDisplay(tree.right));   

               add(panel);

            }      

         }  

      }

    

    

    

      private Node root = null;   // Root of binary tree

    

    

   /**

   The getView method creates and returns a

   a graphical view of the binary tree.

   @return A panel that displays a view of the tree.

   */

      public JPanel getView()

      {

         return new BTreeDisplay(root);      

      }   

    

   /**

   The public root method adds a value to the

   tree by calling a private root method and

   passing it the root of the tree.

   @param x The value to make root.

   @return true.    

   */

      public boolean root(String x)

      {

         if (root == null){

            root = new Node(x);

            return true;}

         else

            return false;

      }

    

   /**

   The public addLeft method adds a value to the

   tree by locating the desired parent and ensuring

   all requirements are met.

   @param p The desired parent. x The value to add to the tree.

   @return true.    

   */

      public boolean addLeft(String p, String x)

      {

         Node parent = locate(p);

      //Check if root is established.

         if (root == null ){

            return false;}

         //Locate desired parent and checks if child exists.

         else if (parent != null && parent.left == null){

         //Adds node

            parent.left = new Node(x);

            return true;}

         else

            return false;

      }

    

   /**

   The public addRight method adds a value to the

   tree by locating the desired parent and ensuring

   all requirements are met.

   @param p The desired parent. x The value to add to the tree.

   @return true.    

   */

      public boolean addRight(String p, String x)

      {

         Node parent = locate(p);

      //Check if root is established.

         if (root == null ){

            return false;}

         //Locate desired parent and checks if child exists.

         else if (parent != null && parent.right == null){

         //Adds node

            parent.right = new Node(x);

            return true;}

         else

            return false;

      }     

    

      public Node locate(String p)

      {

      // Call the private recursive method

         return locate(p, root);

      }

    

   /**

   The method contains checks whether an

   item is in a binary search tree.

   @param x The item to check for.

   @param famTree The binary tree to look in.

   @return true if found, false otherwise.

   */

      private Node locate(String p, Node famTree)

      {

        //new Node result, set to null.

         Node result = null;

            if (famTree == null)

            return null;

        //if passed node contains value, return it.     

            if (famTree.value.equals(p))

            return famTree;

            //if left child not null, recursively call locate with left child.

         if (famTree.left != null)

            result = locate(p,famTree.left);

            //if parent still not found, recursively call right locate passing the right child.

         if (result == null)

            result = locate(p,famTree.right);

         return result;

      }

    

   }

Please like my answer and show some love and support.

Thank you.