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.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

5-Write an EBNF rules that describe the following while statement of Java. Then, write the recursive-descent subprogram in Java for the EBNF rule. Please submit your source code and a screenshot of the parsing of the following examples. do { if ( number % 2 == 0 ) even ++; number=number+1; } while (number <= 10)
2 ASAP PLEASE.... Define a Haskell instance of the Functor class for the following type of binary tree with data in nodes and leaves: The definition should be used as below.data Tree a = Leaf a | Node a (Tree a) (Tree a) Note: I need code for exactly as above, noooooooooooooo expalanations, just code for above.
-- > In C++ write a program without using classes, and build in functions, only use structure.!!!!!! Populate a tree via a text file (input.txt) Make sure that after every insert, the tree is balanced.At the end, display the tree in level format. Make sure to include the height and the balancefactor of every node in your output. Redirect the display to an output file (output.txt)Hint://I will not accept any other algorithm//This is not a recursive algorithmnode * rebalance(node *node){node->height = max(height(node->left), height(node->right)) + 1;int balance = getBalance(node); //node->left - node->right/*do rotations as necessaryIf Left heavy outside : return rightRotate(node);If right heavy outside: return leftRotate(node);If left heavy inside: left rotation first, right rotation 2nd, return top nodenode->left = leftRotate(node->left);return rightRotate(node);if right heavy inside: right rotation first, left rotation 2nd, return top nodenode->right =…
please answer in scheme racket flavor 1. Create the recursive function far-left that will find the left-most value 2.Create the recursive function far-right that will find right-most value 3. Write depth, a procedure that takes a tree as an argument and returns the largest number of nodes connected through parent-child links. That is, a leaf node has depth 1; a tree in which all the children of the root node are leaves has depth 2. Our world tree has depth 4 (because the longest path from the root to a leaf is, for example, world, country, state, city). 4. Write count-nodes, a procedure that takes a tree as an argument and returns the total number of nodes in the tree. (Earlier we counted the number of leaf nodes.) (define (leaf? node) (null? (children node))) (define (datum node) (car node)) (define (children node) (cdr node)) (define (count-leaves tree) (if (leaf? tree) 1 (count-leaves-in-forest (children tree)) ) ) (define (count-leaves-in-forest forest) (if (null? forest) 0 (+…
Write a Haskell function hasItem which takes two inputs: an integer item and a tree that is of the following recursive data type; hasItem returns True if tree has the item, otherwise hasItem returns False. data Tree = Leaf Int | Bintree Tree Char Tree deriving (Show)
(Recursive Exponentiation) Write a recursive function power(base, exponent) that wheninvoked returnsbaseexponentFor example, power(3, 4) = 3 * 3 * 3 * 3. Assume that exponent is an integer greater than or equalto 1. Hint: The recursion step would use the relationshipbaseexponent = base * baseexponent–1and the terminating condition occurs when exponent is equal to 1 becausebase1 = base
Question 1:Convert a decimal to binary and binary to decimal using recursionTest your implementation with following examples:● (1947)10 = (11110011011)2● (1992)10 = (11111001000)2● (2021)10 = (11111100101)2Question 2:Implement a member function that prints a singly linked list in reverse order without creating acopy or changing the original List.void printBackwards() constQuestion 3:Implement a recursive member function “isSorted” which recursively checks whether the linked listis sorted (ascendingly).bool isSorted() constQuestion 4:You will implement a function bool Equalize_Occurrences (char key, int maxcount) of theclass list, that will take a character key and maximum count for the consecutive occurrences of thekey inparameters. It will then traverse the list, verify and update the consecutive occurrences of the keyaccordingto maximum count and returns true. It returns false if no occurrence of key is found.Note: You can traverse the list only once for this task.
1. Explain where local variables and dynamically allocated variables are created. Why do we need to call delete for dynamically allocated variables? 2. Give a non-recursive version of the binary search tree operations findMin, findMax This is a data structure question answer carefully and dont plagarize please
a) The preorder traversal of a Binary Search Tree (BST) is given below.40 20 10 15 25 30 60 50 80 100 Draw the BST and briefly explain the process you followed to build the tree. b) Write a function f1 that takes the root of a binary tree as a parameter and returns the sum of the nodes, which are the left child of another node. The root of the tree is not a child of any node. Consider the following class definitions while writing your code.class Node {public:int key;Node* left;Node* right;};
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!! )
7. Dynamic MathStack The MathStack class shown in this chapter has only two member functions: add and sub. Write the following additional member functions: Function Description mult Pops the top two values off the stack, multiplies them, and pushes their product onto the stack. div Pops the top two values off the stack, divides the second value by the first, and pushes the quotient onto the stack. addAll Pops all values off the stack, adds them, and pushes their sum onto the stack. multA11 Pops all values off the stack, multiplies them, and pushes their prod- uct onto the stack. Demonstrate the class with a driver program. here is the extention file please use it. // Specification file for the IntStack class #ifndef INTSTACK_H #define INTSTACK_H class IntStack { private: int *stackArray; // Pointer to the stack array int stackSize; // The stack size int top; // Indicates the top of the stack public: // Constructor IntStack(int); // Copy constructor…
Define the function (doubleBubbleLst lst). This function should resolve to a list of sublists, where each sublist holds a single element from lst and all sublists from lst are also bubbled, so that every list and sublist has no atoms. This is the deep recursion version of bubbleLst. For example: (doubleBubbleLst '(1 2 (3 4)) ) resolves to '((1) (2) (( (3) (4) ))).