quick-sort/max_node.cpp at main · chandradip2006/quick-sort · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include<bits/stdc++.h>
using namespace std;
class node{
    public:
        int data;
        node* left;
        node* right;
        node(int value){
            data = value;
            left = NULL;
            right = NULL;
        }
};

int max1(node* root){
    if(root==NULL){
        return INT_MIN;
    }
    return max(root->data,max(max1(root->left),max1(root->right)));
}
int main(){
    node* a=new node(2);
    node* root = a;
    node* b=new node(3);
    node* c=new node(4);
    node* d=new node(5);
    node* e=new node(6);
    node* f=new node(7);
    node* g= new node(8);
    node* h=new node(9);
    node* i=new node(10);

    node* j=new node(11);
    node* k=new node(12);
    node* l=new node(13);
    node* m=new node(14);
    node* n=new node(15);
    node* o=new node(16);
    node* p= new node(17);
    node* q=new node(18);
    node* r=new node(19);
    node* s=new node(20);
    node* t=new node(21);
    node* u=new node(22);
    node* v=new node(23);
    node* w=new node(24);
    node* x=new node(25);
    node* y=new node(26);
    node* z=new node(27);

    a->left=d;
    a->right=e;
    d->left=j;
    d->right=m;
    e->left=c;
    e->right=f;
    c->right=p;
    f->left=n;

    cout<<max1(root)<<endl;
}