C++ programming assignment, Since there are 4 problems in the assignment, I am requesting 4 C++ programs. Questions 2, 3, and 4 require sample input files,

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

Good evening, I have a C++ programming assignment I need completed by 2021-11-30 @ 21:30 (Central Standard Time).

The programming assignment has 4 problems. Each problem needs to be completed in a separate C++ program.

Since there are 4 problems in the assignment, I am requesting 4 C++ programs. Questions 2, 3, and 4 require sample input files, which I have attached. Please let me know how quickly this can be completed!

Please text or email if you have any questions! Looking forward to hearing from you soon. - Thank you

 

Question 1

1. Write a program given two binary trees, A and B, searches Tree B for an occurrence of Tree A by

shape not by the contents of the nodes. Print all nodes in Tree B that are roots for a subtree whose

shape is the same as Tree A. The test is if Tree A could be lifted and moved, its nodes would exactly fit

over a subset(s) of nodes in Tree B. In the example below the shape of Tree A appears 3 times in Tree B.

The occurrences start at nodes H, G and K.

TREE A TREE B

Input will be from the keyboard and will consist of 2 strings of letters on separate lines. The first string

will be used to construct Tree A. The second string will be used to construct Tree B. Output to the

screen all nodes in Tree B that are roots for a subtree whose shape is the same as Tree A with one space

between each letter. Multiple nodes may be printed in any order. If none exists, then print NONE. Use a

tree data structure. Refer to the sample output below.

Sample Runs (2):

Enter Tree A: AAB

Enter Tree B: HGFHKIM

Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of