3) The class definition of a BINARY TREE class is given below. It contains an attribute called root that represents the root of a tree. It has a constructor that sets the root to NULL. There are also other methods that manipulates the tree. These methods are findLongestLength(), NumOfNodesDivisibleBy3(), searchForAnElement () and printPreOrder(). The constructor is already implemented. You are required to implement the other four methods. #include #include using namespace std; 11--- class Node; typedef Node* NodePtr; class Node public: int NodePtr left; NodePtr right; Node (0{number =0; left = right= NULL;} Node (int n) { number = n; left = right = NULL;} 3: 11-- number; class tree public: NodePtr root; tree() (root NULL;}; int NumOfNodesDivisibleBy3 (NodePtr root); int findLongestLength(NodePtr root); int searchForAnElement (NodePtr root, int key); int printPreOrder(NodePtr root); 3: 1-- Note: Please answer the question on the next page. All routines MUST be implemented recursively

3) The class definition of a BINARY TREE class is given below. It contains an attribute called root that represents the root of a tree. It has a constructor that sets the root to NULL. There are also other methods that manipulates the tree. These methods are findLongestLength(), NumOfNodesDivisibleBy3(), searchForAnElement () and printPreOrder(). The constructor is already implemented. You are required to implement the other four methods. #include #include using namespace std; 11--- class Node; typedef Node* NodePtr; class Node public: int NodePtr left; NodePtr right; Node (0{number =0; left = right= NULL;} Node (int n) { number = n; left = right = NULL;} 3: 11-- number; class tree public: NodePtr root; tree() (root NULL;}; int NumOfNodesDivisibleBy3 (NodePtr root); int findLongestLength(NodePtr root); int searchForAnElement (NodePtr root, int key); int printPreOrder(NodePtr root); 3: 1-- Note: Please answer the question on the next page. All routines MUST be implemented recursively

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

Q-10)
Write a C++ application to accept a number from a user. Find the reciprocal of the number
QIVA) Using asterisk (*) pattern to write a program in C+ to display such below style: ***
C++
Write a C++ codes based on the image below. Please include these following: - How many products are you going to remove or add? - Select the code of products: - Please select how many pieces (Name of product)
maderchod kyu ek hi quetion upload kr raha h teri maa ki chut (c++)
Question
Create a C++ software that prompts the user to insert numbers indefinitely until the count of even and odd numbers is reached.
Can someone answer the task below?
Convert from C to C++ .Thank you. / include all required libraries#include<stdio.h>#include<stdlib.h>#include<sys/types.h>#include<sys/wait.h>#include<unistd.h> // variable to store number of generationsint num_generations; // function to print the generationsvoid printGeneration(int n){// stop if number of generations are reachedif(n>num_generations)return; // create a forkpid_t p = fork(); // generate new generationsif(p==0)printGeneration(n+1);else if(p>0)wait(0); // wait until child process terminates // print the present generationif(p!=0){// if n is 0if(n==0)printf("Parent. "); // print parent// if n is 1else if(n==1)printf("Child. "); // print child// for all other caseselse{// print grandchildrenfor(int i=0;i<n-2;i++)printf("Great ");printf("Grandchild. ");}// print pid and ppidprintf("pid: %d ppid: %d\n",getpid(),getppid());}} // main functionint main(int argc, char* argv[]){// if no arguments are providedif(argc==1){// print…
i) For the truth table shown in Table Q19, find the logic functions of Zj and Z2 using K Q19. Мар Table Q19 A C Zi Z2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ii) Implement Zj and Z2 using PLA
Using C++, please help me solving this question.