Ancestral Trees Program Plan: Include required header files. Declare and initialize string arrays “people []”, “mother []”, and “father []”. Declare and initialize positions for the integer arrays “mom []”, and “pop []”. Give function prototype “ancestors ()”. Given function definition for “ancestors ()”. Print the name of the person. Check if mom’s position is not equal to -1. Call the function ““ancestors ()”. Check if pop’s position is not equal to -1. Call the function ““ancestors ()”. Define the function “main ()”. Inside this function, Print the ancestors of the person containing index “0” from “people []” array by calling the function “ancestors ()” by passing “0” as the argument. Print the ancestors of the person containing index “6” from “people []” array by calling the function “ancestors ()” by passing “6” as the argument. Return the statement.

Question

Want to see the full answer?

Answer 1

Question

Chapter 14, Problem 12PC

Program Plan Intro

Ancestral Trees

Program Plan:

Include required header files.

Declare and initialize string arrays “people []”, “mother []”, and “father []”.

Declare and initialize positions for the integer arrays “mom []”, and “pop []”.

Give function prototype “ancestors ()”.

Given function definition for “ancestors ()”.

Print the name of the person.

Check if mom’s position is not equal to -1.

Call the function ““ancestors ()”.

Check if pop’s position is not equal to -1.

Call the function ““ancestors ()”.

Define the function “main ()”. Inside this function,

Print the ancestors of the person containing index “0” from “people []” array by calling the function “ancestors ()” by passing “0” as the argument.

Print the ancestors of the person containing index “6” from “people []” array by calling the function “ancestors ()” by passing “6” as the argument.

Return the statement.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained. You have to make the proogram properly in Java: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: Create a class Node having two data members int data; Node next; Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null Create class LinkList having one data members of type Node. Node head Write the following function in the LinkList class publicvoidinsertAtLast(int data);//this function add node at the end of the list publicvoid insertAthead(int data);//this function add node at the head of the list publicvoid deleteNode(int key);//this function find a node containing "key" and delete it publicvoid printLinkList();//this function print all the values in the Linklist public LinkListmergeList(LinkList l1,LinkList l2);// this function…

C++ Queue LinkedList, Refer to the codes I've made as a guide and add functions where it can add/insert/remove function to get the output of the program, refer to the image as an example of input & output. Put a comment or explain how the program works/flow.

Course: Data Structure and Algorithms Language: C++ Question is well explained Question #2Implement a class for Circular Doubly Linked List (with a dummy header node) which stores integers in unsorted order. Your class definitions should look like as shown below: class CDLinkedList;class DNode {friend class CDLinkedList;private int data;private DNode next;private DNode prev;};class CDLinkedList {private:DNode head; // Dummy header nodepublic CDLinkedList(); // Default constructorpublic bool insert (int val); public bool removeSecondLastValue (); public void findMiddleValue(); public void display(); };