Purchase Solution

Binary Trees: Family tree of two generations

Not what you're looking for?

Ask Custom Question

Create a program that uses the structure of binary trees to make a family tree of two generations. The user should input the names when asked, and then the program should display the names.

Please see the attached Image1.jpg on how the program should store its data.

Attachments
Purchase this Solution
Solution Summary

Solution maintains the binary tree in an array. Comments in the code explain how to access the parent nodes of a tree node in this organization. It is also available as an attachment 129367.cpp that can be compiled using "g++ 129367.cpp".

Solution Preview

#include < unistd.h >
#include < iostream >
#include < string >

using namespace std;

// User (1) + Parents (2) + GrandParents (4) = 7
string twoGenerations[7];

int main()
{
cout << "User Name : ";
getline(cin,twoGenerations[0]);

cout << "Father's Name : ";
getline(cin,twoGenerations[1]);

cout << "Mother's Name : ";
...

Purchase this Solution
Free BrainMass Quizzes
Basic Networking Questions

This quiz consists of some basic networking questions.

C# variables and classes

This quiz contains questions about C# classes and variables.

Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

View More Free Quizzes
Related BrainMass Solutions

  • C++ program to determine structurally identical binary trees

    510302 Write a C++ program to determine whether two given binary trees are structurally identical, that is, they are made of nodes with the same values arranged in the same way.

  • Trees

    24264 Trees and Rooted Binary Trees A. If T is a rooted binary tree of height 5, then T has at most 25 leaves. b.

  • Problems about binary search tree in Java

    Answer: If deleting a leaf node, then the two trees are the same. However, if deleting a parent node, the one which at least one child, the two trees are not necessary the same. For example: See the tree shown below (figure a).

  • Books listing program using binary tree

    Keep this format, but modify the program to make it use binary tree instead of ordered linked list. You may use more than one binary trees.

  • Binary tree proof

    28277 Binary Tree Induction # Recall that a binary tree can be defined recursively as: * A Binary Tree is either empty * or A Binary Tree consists of a node with a left and right child both of which are Binary Trees.

  • Graph Theory -Tree and Tree Structures

    Difference between binary and n-ary trees: In a binary tree, each node has at most two children. In a n-ary tree, each node can have any number of children. b) Please refer to the attachment.

  • binary search tree

    You are provided with the declarations and two functions for binary search trees (see the appended). One of the functions is Insert that adds a new element to a binary search tree.

  • Hashing: separate chaining method

    The solution makes use of brief comparative analysis of linked list and balanced binary search tree.

  • Binary Tree Delete Java

    129940 Binary Tree Delete Java (Binary Tree Delete) In this exercise, we discuss deleting items from binary search trees. The deletion algorithm is not as straightforward as the insertion algorithm.

View More Related Solutions