The language is Java. Given my code, I want to make my output look like the first part of the first image's output, but with the numbers in my output. The other two pictures are of my code. I want to make the output look like a tree, as opposed to being close together like that. Thanks.
The language is Java. Given my code, I want to make my output look like the first part of the first image's output, but with the numbers in my output. The other two pictures are of my code. I want to make the output look like a tree, as opposed to being close together like that. Thanks.
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
Related questions
Question
The language is Java. Given my code, I want to make my output look like the first part of the first image's output, but with the numbers in my output. The other two pictures are of my code. I want to make the output look like a tree, as opposed to being close together like that. Thanks.
Transcribed Image Text:example output I
would like mine to
look like
8
9
Node(int data) {
// A class to store a binary tree node
class Node
int data;
Node left = null, right = null;
this.data = data;
class Main
2
if (root == null) {
return;
10
{L
5
System.out.print(root.data + " ");
preorder(root.left);
preorder(root.right);
if (root == null) {
return;
J
11
// Function to perform preorder traversal on a given binary tree
public static void preorder(Node root)
6
12
first part of my code
// Utility function to swap left subtree with right subtree
public static void swap(Node root)
3
13
14
![Node temp = root.left;
root.left=root.right;
root.right = temp;
// Function to invert a given binary tree using preorder traversal
public static void invertBinary Tree (Node root)
{[
// base case: if the tree is empty
if (root == null) {
return;
// swap left subtree with right subtree
swap(root);
// invert left subtree
invertBinaryTree (root.left);
// invert right subtree
invertBinaryTree(root.right);
public static void main(String[] args)
/* Construct the following tree
Node root = new Node(4);
root.left = new Node(2);
root.right = new Node(7);
root.left.left = new Node(1);
root.left.right = new Node(3);
root.right.left = new Node(6);
root.right.right = new Node(9);
invertBinaryTree(root);
preorder(root);](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fff0718a9-6b90-48e9-b239-28d1f13c8cb6%2Fbe36765a-fcc0-4ee7-a69a-69b8b13fd155%2F44h1xo_processed.png&w=3840&q=75)
Transcribed Image Text:Node temp = root.left;
root.left=root.right;
root.right = temp;
// Function to invert a given binary tree using preorder traversal
public static void invertBinary Tree (Node root)
{[
// base case: if the tree is empty
if (root == null) {
return;
// swap left subtree with right subtree
swap(root);
// invert left subtree
invertBinaryTree (root.left);
// invert right subtree
invertBinaryTree(root.right);
public static void main(String[] args)
/* Construct the following tree
Node root = new Node(4);
root.left = new Node(2);
root.right = new Node(7);
root.left.left = new Node(1);
root.left.right = new Node(3);
root.right.left = new Node(6);
root.right.right = new Node(9);
invertBinaryTree(root);
preorder(root);
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education