Program Plan: In the program, we include the header files as needed. Structures are declared for entering new nodes and also entering the values. Function prototypes are declared. output2DTree() will print the output. main() is to take the information and place it accordingly in the binary tree. Program Description: The following program is to print the binary tree in a pattern where it is printing nodes from the left most sides to rightmost. Program: // including the header files as required. #include <iostream> #include <stack> #include<cstring> #define COUNT 10 usingnamespace std; // Declaring the binary tree node struct Nodes { int data_res; Nodes* left_side,*right_side; }; // The following function is to allocate a new node Nodes* new_Node(int data_res) { Nodes* i_node =new Nodes; i_node->data_res = data_res; i_node->left_side = i_node->right_side =NULL; return i_node; } // Function to print binary tree in 2D format. void output2DTree(Nodes *main_root,int fill_space) { // Base case if(main_root ==NULL) return; // Increase distance between levels fill_space += COUNT; // Process right child first output2DTree(main_root->right_side, fill_space); // Print current node after space // count printf("\n"); for(int iloop = COUNT; iloop<fill_space; iloop++) printf(" "); printf("%d\n", main_root->data_res); // Process left child output2DTree(main_root->left_side, fill_space); } // Wrapper over output2DTree() void output2D(Nodes *main_root) { // Pass initial space count as 0 output2DTree(main_root,0); } // Starting of main function. int main() { Nodes *main_root = new_Node(49); main_root->left_side = new_Node(28); main_root->right_side =new_Node(83); main_root->left_side->left_side =new_Node(18); main_root->left_side->right_side = new_Node(40); main_root->right_side->left_side =new_Node(71); main_root->right_side->right_side = new_Node(97); main_root->left_side->left_side->left_side =new_Node(11); main_root->left_side->left_side->right_side =new_Node(19); main_root->left_side->right_side->left_side =new_Node(32); main_root->left_side->right_side->right_side =new_Node(44); main_root->right_side->left_side->left_side =new_Node(69); main_root->right_side->left_side->right_side =new_Node(72); main_root->right_side->right_side->left_side =new_Node(92); main_root->right_side->right_side->right_side =new_Node(99); int the_range, numentry, iloop; //printing the result. output2D(main_root); // set return to 0. return0; } Sample output: 99 97 92 83 72 71 69 49 44 40 32 28 19 18 11

C++ How to Program (10th Edition)

10th Edition

ISBN: 9780134448237

Author: Paul J. Deitel, Harvey Deitel

Publisher: PEARSON

See similar textbooks

Concept explainers

Declaring and Defining the function

A set of statements, which performs a particular task is called a function. The program gains modularity by using function. The application is quite easy to understand, read, and edit when they are created with functions. The developer/programmer creates…

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 19, Problem 19.23E

Chapter 19, Problem 19.25E

Students have asked these similar questions

Language : C

*Data Structures And Algorithm (C Programming) You are going to make C program to solve the general k2 − 1 puzzle. Your program will read an initial state for a k × k table, calculate (preferably minimum number of) steps taking player from initial state to the goal state, and print the solution into an output file.This is a graph search problem and can be solved using several different methods. You will implement Breadth First Search (BFS). Files to work with: starter.c #include <stdio.h>#include <stdlib.h>#include <string.h> int main(int argc, char **argv){FILE *fp_in,*fp_out;fp_in = fopen(argv[1], "r");if (fp_in == NULL){ printf("Could not open a file.\n"); return -1;}fp_out = fopen(argv[2], "w");if (fp_out == NULL){ printf("Could not open a file.\n"); return -1;}char *line = NULL;size_t lineBuffSize = 0;ssize_t lineSize;int k;getline(&line,&lineBuffSize,fp_in);//ignore the first line in file, which is a commentfscanf(fp_in,"%d\n",&k);//read size of…

Problem 2 -- Recursive Palindrome (Grey + Scarlet) Write a recursive method, isPalindrome, which takes a String as a parameter, and returns true if the String is a palindrome. For the purposes of this method, you may assume Strings with a length of o or 1 are palindromes.

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.

Solution Summary: The author explains how output2DTree() prints the binary tree in a pattern where it is printing nodes from the left most sides to rightmost.

Concept explainers

Want to see the full answer?

Chapter 19 Solutions