void doo(list &L){ int item,a,p=L.size0-1; L.retrieve(p,a); for(int i=0;i
void doo(list &L){ int item,a,p=L.size0-1; L.retrieve(p,a); for(int i=0;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
![void doo(list<int> &L){
int item,a,p=L.size()-1; L.retrieve(p,a);
for(int i=0;i<L.size()-1;i++){ L.retrieve(i,item);
if(item<a){a=item; p=i;}}
L.remove(p);}
What is this function do?
a. remove the minimum item from the list
O b. if the list is empty an error is happened
O c. doesn't do anything
O d. remove the last item from the list](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc6cf586c-0ff5-4c32-afd4-161bdd8ecef9%2F2ce28f06-8849-4423-83ef-bfeaf71ccdaf%2Fzoo9gmn_processed.png&w=3840&q=75)
Transcribed Image Text:void doo(list<int> &L){
int item,a,p=L.size()-1; L.retrieve(p,a);
for(int i=0;i<L.size()-1;i++){ L.retrieve(i,item);
if(item<a){a=item; p=i;}}
L.remove(p);}
What is this function do?
a. remove the minimum item from the list
O b. if the list is empty an error is happened
O c. doesn't do anything
O d. remove the last item from the list
![int doo(node<int>*root){
if(root==0 ) return 0;
if(root->left==0 && root->right==0) return root->data;
return doo(root->left) + doo(root->right);
}
This code finds
O a. the sum of leaves items in a binary tree
O b. The minimum item in a binary search tree
O c. the number of leaves in a binary tree
O d. the maximum item in a binary search tree](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc6cf586c-0ff5-4c32-afd4-161bdd8ecef9%2F2ce28f06-8849-4423-83ef-bfeaf71ccdaf%2Fuxb12sr_processed.png&w=3840&q=75)
Transcribed Image Text:int doo(node<int>*root){
if(root==0 ) return 0;
if(root->left==0 && root->right==0) return root->data;
return doo(root->left) + doo(root->right);
}
This code finds
O a. the sum of leaves items in a binary tree
O b. The minimum item in a binary search tree
O c. the number of leaves in a binary tree
O d. the maximum item in a binary search tree
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
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](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education