First, how does binary trees, I know that it consists of data such as right and left, but how doe they work exactly? Second, in the image what does it mean to have struct Node *node, like is this creating an object like any other data type? Third, when using binary trees, how is data moving or being used in binary trees, and what can I try to implement this into? Lastly, how can I try to make an improvement to this binary tree?
First, how does binary trees, I know that it consists of data such as right and left, but how doe they work exactly? Second, in the image what does it mean to have struct Node *node, like is this creating an object like any other data type? Third, when using binary trees, how is data moving or being used in binary trees, and what can I try to implement this into? Lastly, how can I try to make an improvement to this binary tree?
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
I have a few questions about this binary tree.
First, how does binary trees, I know that it consists of data such as right and left, but how doe they work exactly?
Second, in the image what does it mean to have struct Node *node, like is this creating an object like any other data type?
Third, when using binary trees, how is data moving or being used in binary trees, and what can I try to implement this into?
Lastly, how can I try to make an improvement to this binary tree?
Transcribed Image Text:// Implementing struct
// to hold data and struct node_ptr
astruct Node{
int data;
struct Node* Left;
struct Node* right;
struct Node* newNode(int new_data){
struct Node* node = new struct Node; // this is telling node object to the allocated memory to the new
node->data = new_data;
node->Left =
nullptr;
node->right = nullptr;
return node;
void BinaryTrees(){
struct Node *root = newNode( new_data: 9);
newNode(
root->Left =
Declared In: main.cpp
(*root).right = newNo
Node *newNode (int new_data)
root->left->Left = newNodet new_uala: 25);
cout <« root->Left->data;
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
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