Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Given the following definition of a node and binary search tree, write the member functions described below. You may declare and implement more functions if you need but you need to fully code any function you call.  Any function you call will calculate towards runtime of your function.  Please ensure that the run time requirement is met to get full marks   class BST{     struct Node{         int data_;         Node* left_;         Node* right_;         Node(int dat){             data_=dat;             left_=right_=nullptr;         }     };     Node* root_;     ... }; Write the following member functions of BST:   bool BST::removeSmallest(int v); Runtime requirement O(log n) (assuming tree is balanced) This function removes the smallest value from subtree with root value of v

Given the following definition of a node and binary search tree, write the member functions described below. You may declare and implement more functions if you need but you need to fully code any function you call.  Any function you call will calculate towards runtime of your function.  Please ensure that the run time requirement is met to get full marks   class BST{     struct Node{         int data_;         Node* left_;         Node* right_;         Node(int dat){             data_=dat;             left_=right_=nullptr;         }     };     Node* root_;     ... }; Write the following member functions of BST:   bool BST::removeSmallest(int v); Runtime requirement O(log n) (assuming tree is balanced) This function removes the smallest value from subtree with root value of v

Database System Concepts
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
icon
Related questions
Question

Given the following definition of a node and binary search tree, write the member functions described below. You may declare and implement more functions if you need but you need to fully code any function you call.  Any function you call will calculate towards runtime of your function.  Please ensure that the run time requirement is met to get full marks

 

class BST{
    struct Node{
        int data_;
        Node* left_;
        Node* right_;
        Node(int dat){
            data_=dat;
            left_=right_=nullptr;
        }
    };
    Node* root_;
    ...
};

Write the following member functions of BST:

 

bool BST::removeSmallest(int v);

Runtime requirement O(log n) (assuming tree is balanced)


This function removes the smallest value from subtree with root value of v

This function removes the smallest value from subtree with root value of v 60 30 80 100 20 50 70 10 40 90 110 removeSmallest(60) would remove the node 10, and return true removeSmallest(80) would remove the node 70, and return true removeSmallest(90) would remove the node 90, and return true (no nodes are smaller than 90 in subtree with root 90) removeSmallest(55) would remove nothing and return false (55 not found)
Transcribed Image Text:This function removes the smallest value from subtree with root value of v 60 30 80 100 20 50 70 10 40 90 110 removeSmallest(60) would remove the node 10, and return true removeSmallest(80) would remove the node 70, and return true removeSmallest(90) would remove the node 90, and return true (no nodes are smaller than 90 in subtree with root 90) removeSmallest(55) would remove nothing and return false (55 not found)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Types of trees
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
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS