5. Assume the following definition for a node of a binary tree.public class Node {public int data;public Node left; public Node right;public Node (int d) { data = d; left = null; right = null; }}(a) Write a recursive function height (Node root) which calculates and returns the heightof the binary tree rooted at the given root node.public static int height (Node root) {}(b) Consider the following recursive function:public static void fun (int a, int b, int c)int d - 3 - (b + c);if (a > 1) fun (a-1, ь, d);System.out.println (a + "" + b +"" + c) ;if(a > 1) fun (a-1, d, c);What is the output generated by calling: fun (3, 0, 2)?Answer:

The first question will be answered: Class Node is defined as follows: public class Node { public…

5. Assume the following definition for a node of a binary tree. public class Node { public int data; public Node left; public Node right; public Node (int d) { data = d; left = null; right = nul } (a) Write a recursive function height (Node root) which calculates and r of the binary tree rooted at the given root node.

5. Assume the following definition for a node of a binary tree. public class Node { public int data; public Node left; public Node right; public Node (int d) { data = d; left = null; right = nul } (a) Write a recursive function height (Node root) which calculates and r of the binary tree rooted at the given root node.

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

C++ Consider the following function as a property of a LinkedBag that contains a Doubly Linked List. Assume a Node has pointers prev and next, which can be read and changed with the standard get and set methods. Assume that the doubly linked list is: 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6 If you are uncertain what the above diagram depicts, it is a doubly linked list such that: The head of this doubly linked list is the node that contains the value 1. The tail of this doubly linked list is the node that contains the value 6. The 3rd node in this list contains the value 3. The contents of this list are the values 1 through 6 in sequential order. The following questions are regarding the linked list after after the test_function is run. A. The head of the list after the test_function is run contains the value: B. The tail of the list after the test_function is run contains the value: C. The 3rd node in the list after the test_function is run…
C＋＋
Programming assignments1) Waiting line simulation in an Indian post office:In an Indian post office that not only delivers mail but also functions as a savingsbank carrying out specific transactions, a lone postal worker serves a single queue ofcustomers. Every customer receives a token # (serial number) as soon as they enterthe queue. After service, the token is returned to the postal worker, and the customerleaves the queue. At any point in time, the worker may want to know how manycustomers are yet to be served.i) Implement the system using an appropriate queue data structure, simulating arandom arrival and departure of customers after service completion.ii) If a customer arrives to operate their savings account at the post office, thenthey are attended to first by permitting them to join a special queue. In such a case,the postal worker attends to them immediately before resuming their normal serviceof mail delivery. Modify the system to implement this addition in service
write in c++ Define the 3 bolded functions for the Queue (circular array): class Queue { private: double array[10000]; int front, rear, numItems; public: Queue() {front = numItems = 0; rear = -1;} bool isEmpty(); bool isFull(); void enqueue(double d); int dequeue(); void dequeueMany(int n); //remove n values from the front void enqueueMany(double values[], int n); //add n values from the array}; Hints: void dequeueMany(int n) (hint 6 lines of code, no loops, if there are more than n elements in the queue, use math to re-compute front. Otherwise, make the queue empty. Don’t forget to update numItems. void enqueueMany(int values[], int n) (hint 3 lines of code, use a for loop, call another function, but make sure there’s enough room in the array first!! )
Single Linked Linear List (S.L.L.L.) 1-Write a steps to search for a node contain a given value in a S.L.L.L. its head is given by pointer variable ( First ) 2-Write Recursive function to count number of nodes in a given S.L.L.L. 3-Write a steps to count number of nodes contain odd number in a given S.L.L.L. its head is given by pointer variable ( First ). 4-Write a steps to test values stored in S.L.L.L. if it is in ascending order or not .
C++ code Write a program to perform following tasks: Given a binary tree of integers, the task is to write in-order tree traversal method that display node’s data if it is even positive number. In all other cases it should display -1. A.Given an array and an integer N, find elements which are divisible by N, using STL Algorithms in C++. B.Given a vector, reverse this vector using STL in C++ without using predefined functions/algorithms. C;Given an integer array containing repeating elements, find number of occurrences of each element using STL map (without using any predefined method) in C++. MUST BE ALL (A.B.C) IN ONE PROGRAM
Q4) Define a recursive function named findDigits : int -> int list such that findDigits returns [] if n is not positive, and returns the list of the digits of n in the order in which they appear in n. # findDigits 3124;; : int list = [3; 1; 2; 4] # findDigits 352663;; : int list = [3; 5; 2; 6; 6; 3]
Language/Type: C++ binary trees pointers recursion Write a function named hasPath that interacts with a tree of BinaryTreeNode structures representing an unordered binary tree. The function accepts three parameters: a pointer to the root of the tree, and two integers start and end, and returns true if a path can be found in the tree from start down to end. In other words, both start and end must be element data values that are found in the tree, and end must be below start, in one of start's subtrees; otherwise the function returns false. If start and end are the same, you are simply checking whether a single node exists in the tree with that data value. If the tree is empty, your function should return false. For example, suppose a BinaryTreeNode pointer named tree points to the root of a tree storing the following elements. The table below shows the results of several various calls to your function: 67 88 52 1 21 16 99 45 Call Result Reason hasPath(tree, 67, 99) true path exists…
Programming homework1) Simulated waiting queue in an Indian post office: In an Indian post office that not only distributes mail but also performs some financial activities like a savings bank, a lone postal worker attends to a single lineup of clients. As soon as a consumer enters the line, they are given a token # (serial number). After receiving assistance, the consumer exits the queue while the postal worker receives the token back. The employee could inquire as to how many consumers are still unattended at any one time.i) Put the system into practise using a suitable queue data structure, simulating the arrival and departure of consumers at random when the service is finished.
Computer science JAVA programming question i need help with this entire question please
C++ PROGRAMMINGTopic: Binary Search Trees Explain the c++ code below.: It doesn't have to be long, as long as you explain what the important parts of the code do. (The code is already implemented and correct, only the explanation needed) node* left(node* p) { return p->left; } node* right(node* p) { return p->right; } node* sibling(node* p){ if(p != root){ node* P = p->parent; if(left(P) != NULL && right(P) != NULL){ if(left(P) == p){ return right(P); } return left(P); } } return NULL; } node* addRoot(int e) { if(size != 0){ cout<<"Error"<<endl; return NULL; } root = create_node(e,NULL); size++; return root; } node* addLeft(node* p, int e) { if(p->left == NULL){ node* newLeft =…