C++ Code///////#include <iostream>class BTNode {public:int item;BTNode *left;BTNode *right;BTNode(int i, BTNode *l=nullptr, BTNode *r=nullptr):item(i),left(l),right(r){}};BTNode *root = nullptr;void insert(int i) {//implement code here}int main(){insert (5);insert (10);insert (1);if (root){std::cout << "root = " << root->item << std::endl;if (root->left)std::cout << "root->left = " << root->left->item << std::endl;if (root->right)std::cout << "root->right = " << root->right->item << std::endl;}return 0;} 8.12 Assignment: BST InsertImplement a function to insert a node into a binary search tree. Using the following class and function definition:class BTNode {public:int item;BTNode *left;BTNode *right;BTNode (int i, BTNode *1=nullptr, BTNode *r=nullptr):item (i),left (1),right(r){}} ;BTNode *root = nullptr;void insert(int i) {// implementIf the value to be inserted is already in the BST, then it should not be inserted a second time.

CODE: // Function to create a new binary tree node having given key BTNode* newBTNode(int key) {…

Answered: C++ Code /////// #include class…

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

See similar textbooks

Related questions

Concept explainers

Question

C++ Code

///////

#include <iostream>

class BTNode {
public:
int item;
BTNode *left;
BTNode *right;
BTNode(int i, BTNode *l=nullptr, BTNode *r=nullptr):item(i),left(l),right(r){}
};

BTNode *root = nullptr;

void insert(int i) {
//implement code here
}

int main()
{
insert (5);
insert (10);
insert (1);

if (root)
{
std::cout << "root = " << root->item << std::endl;
if (root->left)
std::cout << "root->left = " << root->left->item << std::endl;
if (root->right)
std::cout << "root->right = " << root->right->item << std::endl;
}

return 0;
}

8.12 Assignment: BST Insert
Implement a function to insert a node into a binary search tree. Using the following class and function definition:
class BTNode {
public:
int item;
BTNode *left;
BTNode *right;
BTNode (int i, BTNode *1=nullptr, BTNode *r=nullptr):item (i),left (1),right(r){}
} ;
BTNode *root = nullptr;
void insert(int i) {
// implement
If the value to be inserted is already in the BST, then it should not be inserted a second time.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

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