code_2.cpp

//
//  code_2.cpp
//  Algorithm
//
//  Created by Mohd Shoaib Rayeen on 15/04/19.
//  Copyright © 2019 Shoaib Rayeen. All rights reserved.
//


#include <iostream>
#include <stack>
using namespace std;
struct bnode {
    int data;
    bnode *left;
    bnode *right;
};

class btree {
public:
    bnode *root;
    btree();
    void insert();
    void display();
    bnode* newNode(int);
    int maximum(bnode* );
};
btree::btree() {
    
    root = NULL;
}
bnode* btree:: newNode(int value) {
    
    bnode* temp=new bnode;
    temp->data=value;
    temp->left=NULL;
    temp->right=NULL;
    return temp;
}
void btree:: insert() {
    root = newNode(12);
    root->left = newNode(21);
    root->right = newNode(31);
    root->left->left = newNode(4);
    root->right->left = newNode(5);
    root->right->right = newNode(6);
    root->right->left->right = newNode(7);
    root->right->right->right = newNode(8);
    root->right->left->right->left = newNode(13);
}


void btree::display() {
    
    insert();
    cout << "\nMaximum Node\t:\t" << maximum(root);
}

int btree::maximum(bnode* root) {
    if (!root) {
        return 0;
    }
    int maxNode = root->data;
    stack<bnode*> s;
    s.push(root);
    while(!s.empty()) {
        root = s.top();
        s.pop();
        if ( root->left ) {
            maxNode = max (maxNode , root->left->data);
            s.push(root->left);
        }
        if ( root->right ) {
            maxNode = max (maxNode , root->right->data);
            s.push(root->right);
        }
    }
    return maxNode;
}

int main() {
    btree obj;
    obj.display();
    cout << "\n";
    return 0;
}