Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

bartleby

Concept explainers

Question
100%

Using the code source screenshot (C++) explain in depth what each line of code does.

[画像:7 #include <iostream> 8 using namespace std; 9. 10 struct node { 11 12 int info; struct node *left; struct node *right; }; 13 14 15 16 17 struct node *generateNode(int value) { 18 struct node *temp = (struct node*) malloc(sizeof(struct node)); temp->info = value; temp->left = temp->right = NULL; return temp; 19 20 21 22 23 24 } 25 26 void preorder(struct node *root) { 27 if (root != NULL) { cout << root->info < " "; 28 29 preorder(root->left); preorder(root->right); } 30 31 32 33 } 34 35 struct node* addNode(struct node* node, int value) { 36 if (node == NULL) return generateNode(value); if (value < node->info) node->left = addNode(node->left, value); else if (value > node->info) node->right = return node; } 37 38 39 40 41 42 addNode(node->right, value); 43 44 45 46 int main() { 47 48 struct node *root = NULL; root = addNode(root, 6); 49 50 addNode(root, 2); addNode(root, 1); addNode(root, 4); addNode(root, 3); addNode(root, 5); addNode(root, 8); addNode(root, 7); addNode(root, 9); 51 52 53 54 55 56 57 58 59 cout << "\nThe pre-order tree traversal of the nodes’ values is: "; preorder(root); cout << "\n" << endl; 60 61 62 63 64 return 0; } 65 ]
expand button
Transcribed Image Text:7 #include <iostream> 8 using namespace std; 9. 10 struct node { 11 12 int info; struct node *left; struct node *right; }; 13 14 15 16 17 struct node *generateNode(int value) { 18 struct node *temp = (struct node*) malloc(sizeof(struct node)); temp->info = value; temp->left = temp->right = NULL; return temp; 19 20 21 22 23 24 } 25 26 void preorder(struct node *root) { 27 if (root != NULL) { cout << root->info < " "; 28 29 preorder(root->left); preorder(root->right); } 30 31 32 33 } 34 35 struct node* addNode(struct node* node, int value) { 36 if (node == NULL) return generateNode(value); if (value < node->info) node->left = addNode(node->left, value); else if (value > node->info) node->right = return node; } 37 38 39 40 41 42 addNode(node->right, value); 43 44 45 46 int main() { 47 48 struct node *root = NULL; root = addNode(root, 6); 49 50 addNode(root, 2); addNode(root, 1); addNode(root, 4); addNode(root, 3); addNode(root, 5); addNode(root, 8); addNode(root, 7); addNode(root, 9); 51 52 53 54 55 56 57 58 59 cout << "\nThe pre-order tree traversal of the nodes’ values is: "; preorder(root); cout << "\n" << endl; 60 61 62 63 64 return 0; } 65
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
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
    Text book image
    Database System Concepts
    Computer Science
    ISBN:9780078022159
    Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
    Publisher:McGraw-Hill Education
    Text book image
    Starting Out with Python (4th Edition)
    Computer Science
    ISBN:9780134444321
    Author:Tony Gaddis
    Publisher:PEARSON
    Text book image
    Digital Fundamentals (11th Edition)
    Computer Science
    ISBN:9780132737968
    Author:Thomas L. Floyd
    Publisher:PEARSON
    Text book image
    C How to Program (8th Edition)
    Computer Science
    ISBN:9780133976892
    Author:Paul J. Deitel, Harvey Deitel
    Publisher:PEARSON
    Text book image
    Database Systems: Design, Implementation, & Manag...
    Computer Science
    ISBN:9781337627900
    Author:Carlos Coronel, Steven Morris
    Publisher:Cengage Learning
    Text book image
    Programmable Logic Controllers
    Computer Science
    ISBN:9780073373843
    Author:Frank D. Petruzella
    Publisher:McGraw-Hill Education