int doo(node*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. the maximum item in the leaves of a binary tree b. find the minimum item in the leaves of a binary tree c. find the sum of leaves items in a binary tree d. find the minimum item in a binary tree

int doo(node*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. the maximum item in the leaves of a binary tree b. find the minimum item in the leaves of a binary tree c. find the sum of leaves items in a binary tree d. find the minimum item in a binary tree

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter3: Understanding Structure

Section: Chapter Questions

Problem 7RQ

See similar textbooks

Similar questions

In C, using malloc to allocate memory for a linked list uses which memory allocation scheme? Heap allocation Static allocation
#include Servo servo; int const trigPin = 9; int const echoPin = 8; #define red 5 #define green 6 void setup() { pinMode(trigPin, OUTPUT); pinMode(echoPin, INPUT); pinMode(red,OUTPUT); pinMode(green,OUTPUT); servo.attach(10); } void loop() { int duration, distance; digitalWrite(trigPin, HIGH); digitalWrite(trigPin, LOW);// Measure the pulse input in echo pin duration = pulseIn(echoPin, HIGH);// Distance is half the duration devided by 29.1 (from datasheet) distance = (duration/2) / 29.1;// if distance less than 0.5 meter and more than 0 (0 or less means over range) if (distance = 0) { servo.write(60); digitalWrite(green,HIGH); digitalWrite(red,LOW); delay(200); } else { servo.write(10); digitalWrite(red,HIGH); digitalWrite(green,LOW); delay(80); } } TASK: create a flowchart using this code, showing the input, output and the conditions on the loop. Lastly, the flowchart must return if ever the conditions have met or not
Modify the given code to accept float instead of int as a coefficient in C LANGUAGE: // Node structure containing power and coefficient of// variablestruct Node {int coeff;int pow;struct Node* next;}; // Function to create new nodevoid create_node(int x, int y, struct Node** temp){struct Node *r, *z;z = *temp;if (z == NULL) {r = (struct Node*)malloc(sizeof(struct Node));r->coeff = x;r->pow = y;*temp = r;r->next = (struct Node*)malloc(sizeof(struct Node));r = r->next;r->next = NULL;}else {r->coeff = x;r->pow = y;r->next = (struct Node*)malloc(sizeof(struct Node));r = r->next;r->next = NULL;}} // Function Adding two polynomial numbersvoid polyadd(struct Node* poly1, struct Node* poly2,struct Node* poly){while (poly1->next && poly2->next) {// If power of 1st polynomial is greater then 2nd,// then store 1st as it is and move its pointerif (poly1->pow > poly2->pow) {poly->pow = poly1->pow;poly->coeff = poly1->coeff;poly1 =…
C++ Program #include <iostream>#include <cstdlib>#include <ctime>using namespace std; int getData() { return (rand() % 100);} class Node {public: int data; Node* next;}; class LinkedList{public: LinkedList() { // constructor head = NULL; } ~LinkedList() {}; // destructor void addNode(int val); void addNodeSorted(int val); void displayWithCount(); int size(); void deleteAllNodes(); bool exists(int val);private: Node* head;}; // function to check data exist in a listbool LinkedList::exists(int val){ if (head == NULL) { return false; } else { Node* temp = head; while (temp != NULL) { if(temp->data == val){ return true; } temp = temp->next; } } return false;} // function to delete all data in a listvoid LinkedList::deleteAllNodes(){ if (head == NULL) { cout << "List is empty, No need to delete…
Recursive Descent subprogram with EBNF rule, using C or Java syntax (syntax) Type (Recursive-Descent Subprogram): -> while () ; The lex method to be used reads a single lexeme, and the lexemes' token code is in the nextToken variable is to the left. Suppose that the defined tokens are respectively: while - WHILE_CODE left parantex - LEFTPAREN_CODE right parenthesis - RIGHTPAREN_CODE semicolon - SEMICOLON_CODE If any error is caught, create the function that calls the error function.
Consider the following code. handler () {;} main () { struct sigaction actA, actB; sigset t oldset; sigset_t addset; sigemptyset (&addSet); sigaddset (&addset,SIGUSR1); sigprocmask (SIG BLOCK, &addset,&oldset); //-- Not using oldset here actA. sa handler=handler; actA. sa flags=0; sigemptyset(&actA.sa mask) ; sigaction (SIGTERM, &actA, (struct sigaction *) 0); Select all the signals that will be blocked during the execution of handler() after the successful execution of this code. O SIGUSR1 O SIGUSR2 O SIGTERM
c++ programming Complete all these 2 methods for the node Node methods •int get_depth(): Returns the depth of the node. •int get_height(): Returns the height of the node. Initial code to be completed:struct node { node* parent; node* right; node* left; int element; int get_depth() { return 0; } int get_height() { return 0; }};
Weighted Job Scheduling in C language only please Problem statement: You are given a list of jobs where each job has a start time, finish time, and the profit associated with that job, find the maximum profit subset of non-overlapping jobs. Problem description: The problem wants you to find the maximum profit that you can make after performing a certain number of jobs such that each job has a certain condition that you can start a job only if the start time of the current job is greater than the finish time of the previous job. You are required to develop some algorithm such that the job start time and the finish time does not coincide with other jobs. Output: (Attached photo)
Please convert the code to C language //separate chaining#include <bits/stdc++.h>using namespace std; class node {public: int data; node* next; node() { data = 0; next = NULL; } node(int x) { data = x; next = NULL; }}; node* add(node* head, int data){ if (head == NULL) { head = new node(data); return head; } node* temp = head; while (temp->next) { temp = temp->next; } temp->next = new node(data); return head;} void print(node* head){ if (!head) { cout << "NULL\n"; return; } node* temp = head; while (temp) { cout << temp->data << "->"; temp = temp->next; } cout << "NULL\n";} int main(){ //set of input numbers vector<int> arr{ 123, 456, 763, 656, 908, 238, 231 }; //initialize the hash table //each entry of the hash table is a linkedlist vector<node*> hash(10); //size of…
int machineCompare1(struct machine* mac1, struct machine* mac2){ struct mac1; struct mac2; char make1[21], make2[21]; char model1[51], model2[21]; if((lap1 -> make1 == lap2 -> make2) && (lap1 -> model1 == lap2 -> model2)) return 0; else return 1;} have to create function to compare make and model of 2 machines - it's using structures - not sure if this is correct/ on the right track?
prg-1 #include <iostream>using namespace std; struct Node { int data; Node* left; Node* right;}; Node* newNode(int data) { Node* node = new Node; node->data = data; node->left = NULL; node->right = NULL; return node;} void printInorder(Node* node) { if (node == NULL) return; printInorder(node->left); cout << node->data << " "; printInorder(node->right);} void printPreorder(Node* node) { if (node == NULL) return; cout << node->data << " "; printPreorder(node->left); printPreorder(node->right);} void printPostorder(Node* node) { if (node == NULL) return; printPostorder(node->left); printPostorder(node->right); cout << node->data << " ";} int main() { Node* root = newNode(70); root->left = newNode(60); root->left->left = newNode(58); root->left->right = newNode(62); root->left->left->left =…
please convert to C languange #include<bits/stdc++.h>using namespace std; class tree{ //tree node public: int data; tree *left; tree *right;}; bool hasRootToLeafSum(tree *root, int s){ bool path=false; //declare boolean variable path //base condition checking if(root==NULL && s==0) return true; s-=root->data; //subtract current root value //checking whether leaf node reached and remaining sum =0 if(s==0 && root->left==NULL && root->right==NULL) return true; //recursively done for both subtrees if(root->left){//for left subtree path=path||hasRootToLeafSum(root->left, s); } if(root->right){//for right subtree path=path||hasRootToLeafSum(root->right, s); } return path;} tree* newnode(int data){ //creating new nodes tree* node = (tree*)malloc(sizeof(tree)); node->data = data; node->left = NULL; node->right = NULL;…