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
icon
Related questions
Question

C++ please 

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<iostream>
#include<string>
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
Transcribed Image Text: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<iostream> #include<string> 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
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Concept of Parenthesis
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education