int doo(node*root){ if(root !=0) { if(root->left==0 && root->right==0) return root->data; return doo(root-> right); } } this code used for O a. find the first right item in the binary tree if it has a right sub tree O b. find the maximum item in a binary tree if it has a right sub tree O c. find the number of right leaves in a binary tree if it has a right sub tree O d. find the maximum item in a binary search tree if it has a right sub tree

int doo(node*root){ if(root !=0) { if(root->left==0 && root->right==0) return root->data; return doo(root-> right); } } this code used for O a. find the first right item in the binary tree if it has a right sub tree O b. find the maximum item in a binary tree if it has a right sub tree O c. find the number of right leaves in a binary tree if it has a right sub tree O d. find the maximum item in a binary search tree if it has a right sub tree

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

int doo(node<int>*root){ if(root !=0 ) { if(root->left==0 && root->right==0) return root->data; int L=doo(root->left); int R=doo(root->right); if(L>R) return R; else return L;} } this code used for a. find the sum of leaves items in a binary tree b. find the minimum item in a binary tree c. find the minimum item in the leaves of a binary tree d. the maximum item in the leaves of a binary tree
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. 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
void doo(node<int>*root){ if(root !=0) { node<int>*p=root; while(root->next!=0) root=root->next; p->data=root->data; } What is this code do? a. doesn't do anything because the root parameter is passed by value b. change the root item in the binary tree with the farthest leaf item c. set the first item in the linked list as the last item d. swap the first item with the last item in the linked list
2. Write the code for preorder traversal of a binary tree. struct node{ int data; struct node *left, *right; } void preorder(node *x) { }
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*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<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
Multiple choice in data structures 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 tree if it has a right sub tree b. find the first right item in the binary tree if it has a right sub tree c. find the number of right leaves in a binary tree if it has a right sub tree d. find the maximum item in a binary search tree if it has a right sub tree
Given the following struct that represents a binary tree: struct Node { int key: Node "parent; Node "left; Node "right; Nodelint k) : key(k), parent(nullptr), left(nullptr), right(nullptr) (I: 1: Write a recursive function that prints out the nodes in a tree stored using the above structure in order to cout. The function prints the depth (root depth is at 0) and key of that node separated by a colon (Example "O: 10\n" for root with key 10). Your function CAN NOT create any local variables and can only use what is passed to the function. Use the below function signature (NOTE: this is not a class method). void inorderAndDepth(Node "node, int depth)
2. public boolean isFull ( BinaryNode t ) This function takes as input the root of a BST and returns true if it is full or false if it is not. 3. public Boolean isAVLTree( BinaryNode t ) This function takes as input the root of a BST, and returns true if the BST is an AVL tree, i.e. is balanced, or returns false if not.