int doo(node*root){ if(root !=0 ) { doo(root->left); doo(root->right); return root->data; }} this code used for O a. find the root value of the binary tree if it has items O b. print the items in the binary tree if it has items c. find the farthest left item in the binary tree if it has items O d. find the farthest right item in the binary tree if it has items

int doo(node*root){ if(root !=0 ) { doo(root->left); doo(root->right); return root->data; }} this code used for O a. find the root value of the binary tree if it has items O b. print the items in the binary tree if it has items c. find the farthest left item in the binary tree if it has items O d. find the farthest right item in the binary tree if it has items

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

Similar questions

node<int>* doo(node<int>*root, int x){ if(root==0 || root->data==x) return root; if(root->data<x) return doo(root->right,x); else return doo(root->left,x);} what is this code do? a. Search about an item in the binary tree b. search about the item that is minimum and maximum in the same time in the binary tree c. search about an item in the doubly linked list d. search about a leaf item in the binary tree
void F(node<int>&*root){if(root!=0){F(root->left); F(root->right); root->data=0; delete root;}root=0;} this code Select one: a. free the binary tree and returns it empty b. Set all data items in the binary tree to 0 c. remove all items in the binary tree without changing its size d. all of them
int doo(node<int>*root){ if(root !=0 ) { if(root->left==0 && root->right==0) return root->data; return doo(root->right); } } this code used for a. find the maximum item in a binary search tree if it has a right sub tree b. find the number of right leaves in a binary tree if it has a right sub tree c. find the maximum item in a binary tree if it has a right sub tree d. find the first right item in the binary tree if it has a right sub tree
void F(node<int>&*root){if(root!=0){F(root->left); F(root->right); root->data=0; delete root;}root=0;} this code Select one: a. all of them b. Set all data items in the binary tree to 0 c. free the binary tree and returns it empty d. remove all items in the binary tree without changing its size
void F(node<int>&*root){if(root!=0){F(root->left); F(root->right); root->data=0; delete root;}root=0;} this code Select one: a.all of them b.Set all data items in the binary tree to 0 c.free the binary tree and returns it empty d.remove all items in the binary tree without changing its size
In C++, develop an algorithm that inserts the value val into a binary search tree with root. If the tree is empty, root = null. The algorithm returns the root of the tree containing the added item. You should assume that “new node” creates a new node with data field data and reference fields left (for left child) and right (for right child).
IN JAVA Write an algorithm that returns the second largest value in a binary search tree containing at least two nodes.If the largest value is in node L, the second largest value is in either the parent of node L or the largest node inL’s left subtree.
Code to Implement a binary tree that allows you to change the key of a node. When a key is changed, it will need to be removed from the tree and reinserted
A node in a binary tree must have exactly? a) One childb) Two childrenc) Three childrend) None of the above
PLease help. Java Yatin is playing PUBG and he has reached a place with a large staircase in front of him.And there is an enemy at each landing of the staircase.This is not the actual staircase. He is looking at the staircase from sideways.The staircase is analogous to a binary tree with each of its nodes as a landing of thestaircase and each of its edges as stairs from one landing to another.Yatin wants to kill the maximum possible number of enemies. He can kill every personhe can see from his position with his suppressed sniper gun. But he can see only thepersons at the leftmost standing at each level and cannot see the rest.Before starting shooting them, he wants to know how many persons he can kill. He isbusy keeping an eye on the enemies. So he wants you to find out the maximum numberof people he can kill from that location by providing you with the analogous a binarysearch tree.[ Note: Players do not change their position after one player has died, i.e. the leftmostnode remains…
Suppose the root of a binary search tree (BST) has the number 36 and you want to search for the number 20 in the BST. After going to the node of 36, where should you search next?
Write a function, singleParentWithLeftChild, that returns the number of nodes in a binary tree (pointed by p) that have only one left child. Your program should NOT count the nodes with one right child. (30 point) // find the number of singles parent nodes in a binary subtree pointed by p int BST::singleParentWithLeftChild(TreeNode* p) { // write your code here! }