in c++ complete the todos //--------------------------- Delete a Node ------------------------------------------------ // This function deletes the Node with 'value' as it's key. This is to be called inside removeRange() function // SILVER TODO Complete the implementation of this function Node* BST::deleteNode(Node *currNode, int value) { if(currNode == NULL) { returnNULL; } elseif(value < currNode->key) { currNode->left = deleteNode(currNode->left, value); } elseif(value > currNode->key) { currNode->right = deleteNode(currNode->right, value); } // We found the node with the value else { //TODO Case : No child if(currNode->left == NULL && currNode->right == NULL) { } //TODO Case : Only right child elseif(currNode->left == NULL) { } //TODO Case : Only left child elseif(currNode->right == NULL) { } //TODO Case: Both left and right child else { ///Replace with Minimum from right subtree } } return currNode; } // This function removes nodes with values in the range low and high. // You need to call deleteNode() function inside this function void BST::removeRange(int low, int high) { for(inti=low; i<=high; i++){ root=deleteNode(root,i); } }
in c++ complete the todos //--------------------------- Delete a Node ------------------------------------------------ // This function deletes the Node with 'value' as it's key. This is to be called inside removeRange() function // SILVER TODO Complete the implementation of this function Node* BST::deleteNode(Node *currNode, int value) { if(currNode == NULL) { returnNULL; } elseif(value < currNode->key) { currNode->left = deleteNode(currNode->left, value); } elseif(value > currNode->key) { currNode->right = deleteNode(currNode->right, value); } // We found the node with the value else { //TODO Case : No child if(currNode->left == NULL && currNode->right == NULL) { } //TODO Case : Only right child elseif(currNode->left == NULL) { } //TODO Case : Only left child elseif(currNode->right == NULL) { } //TODO Case: Both left and right child else { ///Replace with Minimum from right subtree } } return currNode; } // This function removes nodes with values in the range low and high. // You need to call deleteNode() function inside this function void BST::removeRange(int low, int high) { for(inti=low; i<=high; i++){ root=deleteNode(root,i); } }
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
in c++ complete the todos
//--------------------------- Delete a Node ------------------------------------------------
// This function deletes the Node with 'value' as it's key. This is to be called inside removeRange() function
// SILVER TODO Complete the implementation of this function
Node* BST::deleteNode(Node *currNode, int value)
{
if(currNode == NULL)
{
returnNULL;
}
elseif(value < currNode->key)
{
currNode->left = deleteNode(currNode->left, value);
}
elseif(value > currNode->key)
{
currNode->right = deleteNode(currNode->right, value);
}
// We found the node with the value
else
{
//TODO Case : No child
if(currNode->left == NULL && currNode->right == NULL)
{
}
//TODO Case : Only right child
elseif(currNode->left == NULL)
{
}
//TODO Case : Only left child
elseif(currNode->right == NULL)
{
}
//TODO Case: Both left and right child
else
{
///Replace with Minimum from right subtree
}
}
return currNode;
}
// This function removes nodes with values in the range low and high.
// You need to call deleteNode() function inside this function
void BST::removeRange(int low, int high)
{
for(inti=low; i<=high; i++){
root=deleteNode(root,i);
}
}
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 2 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