07.trees.BinarySearchTree;   public class Question2{           public static void main(String[] args) {          new Question2 ();      }

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
icon
Related questions
Question

import java.util.Scanner;

import ch07.trees.BinarySearchTree;

 

public class Question2{

    

     public static void main(String[] args) {

         new Question2 ();

     }

    

     public Question2 () {

         BinarySearchTree<Integer> tree1 = new BinarySearchTree <>();

         BinarySearchTree<Integer> tree2 = new BinarySearchTree <>();     

         Scanner input = new Scanner(System.in);

         System.out.print("How many integers will you insert to tree1? ");

              int n1 = input.nextInt();

         System.out.println("Enter " + n1 + " integers for tree1: ");

              for (int i = 0; i < n1; i++) {

                  tree1.add(input.nextInt());           }

         System.out.print("How many integers will you insert to tree2? ");

              int n2 = input.nextInt();

         System.out.println("Enter " + n1 + " integers for tree2: ");

              for (int i = 0; i < n2; i++) {

                  tree2.add(input.nextInt());           }

         System.out.println("The two trees have the same shape? " + tree1.hasSameShape(tree2));    }

}

public static class BinarySearchTree<T> implements BSTInterface<T> {

     // Write your code here

}

}

2. (Same shape) Two binary trees are said to have the same shape if one of the
following holds:
a. Both trees are empty.
b. Both trees have a single node.
c. The left subtrees have the same shape and the right subtrees have the same
shape.
Add a new method named hasSameShape(BST<E> tree) in the
BinarySearch Tree class that returns true if this tree has the same shape with
the specified tree.
Test your program using the following code:
Transcribed Image Text:2. (Same shape) Two binary trees are said to have the same shape if one of the following holds: a. Both trees are empty. b. Both trees have a single node. c. The left subtrees have the same shape and the right subtrees have the same shape. Add a new method named hasSameShape(BST<E> tree) in the BinarySearch Tree class that returns true if this tree has the same shape with the specified tree. Test your program using the following code:
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Binomial Heap
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education