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.

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.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

What do you mean precisely by "angular expressions"? What distinguishes Angular expressions from JavaScript expressions?
Write this code in any language Python, Java or C++ and complete the code and make sure it runs.
Hi, can someone explain to me the diff between type errors and run-time errors in java, please use simplest detail.
This is from the book starting out with python >>> fourth edition by Tony Gladdis. I sent this one but it was the wrong solution, this problem I am having is a programming one, not Java. I just want to be more concise with my wording, and thank you for helping me.
Write a program in JAVA to generate two Integer numbers between 100 and 150, then calculate and display the sum of all ODD numbers between the generated numbers.
Java Programming Create a program that computes the perimeter of a square, rectangle and the circumference of a circle using interface.
You are required to implement a preprocessor in Java. Your preprocessor should be able to perform the following tasks on an input file, which will be a Java source file: 1. Removing comments 2. Identifying built-in language constructs 3. Identifying loops and methods
Write a program in Java that will convert the measurement from yards to meters.
The Java type int is an abbreviation for:
How to check whether user input is number or not in java? In java
If you're using Java, what are some of the benefits of encapsulation?