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

can u solve this question

1. Unsigned Integers If we have an n-digit unsigned numeral dn-1d n-2...do in radix (or base) r, then the value of that numeral is n−1 r² di Σi=0 which is basically saying that instead of a 10's or 100's place we have an r's or r²'s place. For binary, decimal, and hex r equals 2, 10, and 16, respectively. Just a reminder that in order to write down a large number, we typically use the IEC or SI prefixing system: IEC: Ki = 210, Mi = 220, Gi = 230, Ti = 240, Pi = 250, Ei = 260, Zi = 270, Yi = 280; SI: K=103, M = 106, G = 109, T = 10¹², P = 1015, E = 10¹8, Z = 1021, Y = 1024. 1.1 Conversions a. (15 pts) Write the following using IEC prefixes: 213, 223, 251, 272, 226, 244 21323 Ki8 Ki 223 23 Mi 8 Mi b. (15 pts) Write the following using SI prefixes: 107, 10¹7, 10¹¹, 1022, 1026, 1015 107 10¹ M = 10 M = 1017102 P = 100 P c. (10 pts) Write the following with powers of 10: 7 K, 100 E, 21 G 7 K = 7*10³

answer shoul avoid using AI and should be basic and please explain

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.

Similar questions

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:9780357392676
Author:FREUND, Steven
Publisher:CENGAGE L
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Cengage Learning