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

What are the constraints on a binary tree that is contained in an array?
What are null nodes filled with in a threaded binary tree?a) inorder predecessor for left node and inorder successor for right node informationb) right node with inorder predecessor and left node with inorder successor informationc) they remain nulld) some other values randomly
10
Modify the code on BST and implement the Delete Node algorithms. Consider all the three deleting algorithms. - a leaf node- a node with one child and- a node with two children Here is the code so far: #include <iostream>using namespace std; struct Tree{ char data; Tree *left; Tree *right; Tree *parent;};const int size=10; struct Tree *newTreeNode(int data) { Tree *node = new Tree; node->data = data; node->left = NULL; node->right = NULL; node->parent = NULL; return node;} struct Tree* insertTreeNode(struct Tree *node, int data){ static Tree *p; //retains its value between calls to this function Tree *retNode; if(node == NULL) { retNode = newTreeNode(data); retNode->parent = p; return retNode; } if(data <= node->data ) { p = node; node->left = insertTreeNode(node->left,data); } else { p = node; node->right = insertTreeNode(node->right,data); } return node;} Tree*…
___A example code for __ Q. Print leaf nodes of binary tree.
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.
Do not copy anything
General trees consist of the nodes having any number of child nodes. (True means Doğru; False means Yanlış) Birinieeçin: Chosge one +True false O tankş
11. Preorder Traversal What is the preorder traversal order of the following tree: 3 Pick ONE option 1, 2, 4, 5, 3 4, 2, 5, 1, 3 4,5, 2, 3, 1 1,2, 3, 4, 5 Clear Selection
Given the preorder and inorder traversals of a binary tree, you build that binary tree. 5. Preorder: X В G Y E Inorder: Y G В D E N
If Treel and Tree2 are the trees indicated below, B F) H Tree2 Treel which traversals of Treel and Tree2, respectively, will produce the same sequence of node names? Preorder, postorder Postorder, inorder Postorder, postorder Inorder, inorder Postorder, preorder
Computer Science QUESTION: Expression tree is an application of binary tree to represent arithmetic expression. Write a program to implement an ExpressionTree class that can represent an arithmetic expression with binary operators and integer operands including floating-point. Limit the operators to addition, subtraction, multiplication and division. Operands can be constants or variables. Your class should be able to build a tree from its signature, and evaluate it on a set of values for the variable operands.