Question

3. (Gaddis Exercises 20.4) Tree Height

Write a recursive member function for the BinaryTree class that returns the height of the tree. The height of the tree is the number of levels it contains. Demonstrate the function in a driver program.

CPP FILE CODE:

#include "BinaryTree.h"
#include <iostream>
using namespace std;

BinaryTree::BinaryTree()
{
        root = NULL;
}

BinaryTree::~BinaryTree()
{
        destroy(root);
}

bool BinaryTree::search(int data)
{
        return search(data, root);
}

void BinaryTree::insert(int data)
{
        insert(data, root);
}

void BinaryTree::traverseInOrder()
{
        traverseInOrder(root);
}

void BinaryTree::traversePreOrder()
{
        traversePreOrder(root);
}

void BinaryTree::traversePostOrder()
{
        traversePostOrder(root);
}

void BinaryTree::destroy(Node *tempNode)
{
        if (tempNode)
        {
                destroy(tempNode->left);
                destroy(tempNode->right);
                delete tempNode;
        }
}

bool BinaryTree::search(int data, Node *tempNode)
{
        if (!tempNode)
                return false;
        if (data == tempNode->data)
                return true;
        else if (data < tempNode->data)
                return search(data, tempNode->left);
        else
                return search(data, tempNode->right);
}

void BinaryTree::insert(int data, Node* &tempNode)
{
        if (!tempNode)
        {
                Node *newNode = new Node;
                newNode->data = data;
                newNode->left = NULL;
                newNode->right = NULL;
                tempNode = newNode;
        }
        else if (data < tempNode->data)
                insert(data, tempNode->left);
        else
                insert(data, tempNode->right);
}

void BinaryTree::traverseInOrder(Node *tempNode)
{
        if (tempNode)
        {
                traverseInOrder(tempNode->left); // left
                cout << tempNode->data << endl; // root
                traverseInOrder(tempNode->right);; // right
        }
}

void BinaryTree::traversePreOrder(Node *tempNode)
{
        if (tempNode)
        {
                cout << tempNode->data << endl; // root
                traversePreOrder(tempNode->left); // left
                traversePreOrder(tempNode->right);; // right
        }
}

void BinaryTree::traversePostOrder(Node *tempNode)
{
        if (tempNode)
        {
                traversePostOrder(tempNode->left); // left
                traversePostOrder(tempNode->right);; // right
                cout << tempNode->data << endl; // root
        }
}

HEADER FILE CODE:

struct Node
{
        int data;
        Node *left;
        Node *right;
};

class BinaryTree
{
private:
        Node *root;
        void destroy(Node*);
        bool search(int, Node*);
        void insert(int, Node*&);
        void traverseInOrder(Node*);
        void traversePreOrder(Node*);
        void traversePostOrder(Node*);
public:
        BinaryTree();
        ~BinaryTree();
        bool search(int);
        void insert(int);
        void traverseInOrder();
        void traversePreOrder();
        void traversePostOrder();
};

Answer 1

BinaryTree.h

#ifndef BINARYTREE_H_

#define BINARYTREE_H_

struct Node

{

int data;

Node *left;

Node *right;

};

class BinaryTree

{

private:

Node *root;

void destroy(Node*);

bool search(int, Node*);

void insert(int, Node*&);

void traverseInOrder(Node*);

void traversePreOrder(Node*);

void traversePostOrder(Node*);

int countNodes(Node*);

int maxDepth(Node*);

public:

BinaryTree();

~BinaryTree();

bool search(int);

void insert(int);

void traverseInOrder();

int countNodes();

void traversePreOrder();

void traversePostOrder();

int maxDepth();

};

#endif /* BINARYTREE_H_ */

main.cpp

#include "BinaryTree.h"

#include <iostream>

using namespace std;

BinaryTree::BinaryTree()

{

root = NULL;

}

BinaryTree::~BinaryTree()

{

destroy(root);

}

bool BinaryTree::search(int data)

{

return search(data, root);

}

void BinaryTree::insert(int data)

{

insert(data, root);

}

void BinaryTree::traverseInOrder()

{

traverseInOrder(root);

}

void BinaryTree::traversePreOrder()

{

traversePreOrder(root);

}

void BinaryTree::traversePostOrder()

{

traversePostOrder(root);

}

void BinaryTree::destroy(Node *tempNode)

{

if (tempNode)

{

destroy(tempNode->left);

destroy(tempNode->right);

delete tempNode;

}

}

bool BinaryTree::search(int data, Node *tempNode)

{

if (!tempNode)

return false;

if (data == tempNode->data)

return true;

else if (data < tempNode->data)

return search(data, tempNode->left);

else

return search(data, tempNode->right);

}

void BinaryTree::insert(int data, Node* &tempNode)

{

if (!tempNode)

{

Node *newNode = new Node;

newNode->data = data;

newNode->left = NULL;

newNode->right = NULL;

tempNode = newNode;

}

else if (data < tempNode->data)

insert(data, tempNode->left);

else

insert(data, tempNode->right);

}

int BinaryTree::countNodes()

{

return countNodes(root);

}

int BinaryTree::countNodes(Node *tempNode)

{

if (tempNode)

{

return 1+countNodes(tempNode->left)+

countNodes(tempNode->right);

}

return 0;

}

void BinaryTree::traverseInOrder(Node *tempNode)

{

if (tempNode)

{

traverseInOrder(tempNode->left); // left

cout << tempNode->data << endl; // root

traverseInOrder(tempNode->right);; // right

}

}

void BinaryTree::traversePreOrder(Node *tempNode)

{

if (tempNode)

{

cout << tempNode->data << endl; // root

traversePreOrder(tempNode->left); // left

traversePreOrder(tempNode->right);; // right

}

}

void BinaryTree::traversePostOrder(Node *tempNode)

{

if (tempNode)

{

traversePostOrder(tempNode->left); // left

traversePostOrder(tempNode->right);; // right

cout << tempNode->data << endl; // root

}

}

int BinaryTree::maxDepth(){

return maxDepth(root);

}

int BinaryTree::maxDepth(Node* node)

{

if (node==NULL)

return 0;

else

{

int lDepth = maxDepth(node->left);

int rDepth = maxDepth(node->right);

if (lDepth > rDepth)

return(lDepth+1);

else return(rDepth+1);

}

}

int main(){

BinaryTree tree;

tree.insert(1);

tree.insert(2);

tree.insert(3);

tree.insert(4);

tree.insert(5);

tree.insert(1);

tree.insert(3);

tree.insert(2);

tree.traverseInOrder();

cout<<"Total number of nodes : "<<tree.countNodes();

cout<<"\nTotal max depth is : "<<tree.maxDepth();

return 0;

}

$ー ]JEE Outline ⓔ Make Target El Task List E Console X <terminated> CPP Workspace.exe [C/C++ Application] C:\Users ︿ 1 3 3 4 Total number of nodes 8 Total max depth is : 5$