-
Notifications
You must be signed in to change notification settings - Fork 1
/
MonkArrayandfight.cpp
67 lines (66 loc) · 1.45 KB
/
MonkArrayandfight.cpp
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
62
63
64
65
66
67
#include <iostream>
using namespace std;
struct node{
int data;
struct node *left;
struct node *right;
};
struct node* root=NULL;
struct node* insertNode(int data,struct node *add){
if(add==NULL){
struct node* new1=(struct node*)malloc(sizeof(struct node));
new1->data=data;
new1->left=NULL;
new1->right=NULL;
return new1;
}else{
if(data<=add->data)
add->left=insertNode(data,add->left);
else
add->right=insertNode(data,add->right);
return add;
}
}
void preorder(struct node * add){
if(add==NULL)
return;
cout<<add->data;
preorder(add->left);
preorder(add->right);
}
struct node* searchNode(struct node* temp, int data){
if(temp->data==data || temp==NULL){
return temp;
}
if(data<temp->data)
temp=searchNode(temp->left,data);
if(data>temp->data)
temp=searchNode(temp->right,data);
return temp;
}
int height(struct node * temp){
if(temp==NULL){
return 0;
}
int heightLeft=height(temp->left);
int heightRight=height(temp->right);
if(heightLeft>heightRight)
return 1+heightLeft;
else
return 1+heightRight;
}
int main()
{
freopen("test.txt","r",stdin);
int n,k,p;
cin>>n;
for(int i=0;i<n;i++){
cin>>k;
if(i==0)
root=insertNode(k,root);
else
insertNode(k,root);
}
cout<<height(root);
return 0;
}