The following BST dataInReverse Order function has an error. Complete the testDataInReverseOrder test function using the provided assert True function to discover dataInReverseOrder's error (i.e., fail). The test should pass once the function is fixed. Note: this code is meant to be compiled by itself, so do not assume the existence of an insert function, etc. #include #include #include using namespace std; void assertTrue (bool b, string s) { if (b) { cout << "PASSED: " << s << endl; } else { cout << "FAILED: " << s << endl; } } struct BSTNode { int data; BSTNode left; BSTNode" right; }; // returns a vector of all the data in a BST in reverse sorted order (i.e., descending order) vector dataInReverseOrder (BSTNode* root) { // empty tree case if (root == nullptr) return {}; // non-empty tree vector right = data InReverseOrder (root->right);
The following BST dataInReverse Order function has an error. Complete the testDataInReverseOrder test function using the provided assert True function to discover dataInReverseOrder's error (i.e., fail). The test should pass once the function is fixed. Note: this code is meant to be compiled by itself, so do not assume the existence of an insert function, etc. #include #include #include using namespace std; void assertTrue (bool b, string s) { if (b) { cout << "PASSED: " << s << endl; } else { cout << "FAILED: " << s << endl; } } struct BSTNode { int data; BSTNode left; BSTNode" right; }; // returns a vector of all the data in a BST in reverse sorted order (i.e., descending order) vector dataInReverseOrder (BSTNode* root) { // empty tree case if (root == nullptr) return {}; // non-empty tree vector right = data InReverseOrder (root->right);
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
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
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