data-structures-and-algorithms/BalancedTree.cpp at main · Open-code-source/data-structures-and-algorithms · 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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#include <iostream>

using namespace  std;

class Node{

public:
	int data;
	Node *left,*right;


	Node(int val){
		data=val;
		left=right=NULL;
	}

};

int height(Node *root){
	if(root==NULL){
		return 0;
	}

	int lh=height(root->left);
	int rh=height(root->right);
	return max(lh,rh)+1;
}

bool isBalanvedTree(Node *root){
	if(root==NULL){
		return true;
	}

	if(isBalanvedTree(root->left)==false){
		return false;
	}

	if (isBalanvedTree(root->right)==false)
	{
		return false;
	}

	int lh=height(root->left);
	int rh=height(root->right);

	if(abs(lh-rh)<=1){
		return true;
	}else{
		return false;
	}
}


bool isBalanvedTree2(Node *root,int *height){

	if(root==NULL){

		return true;
	}

	int lh=0,rh=0;
	if(isBalanvedTree2(root->left,&lh)==false);
	{
		return false;
	}

	if(isBalanvedTree2(root->right,&rh)==false){
		return false;
	}

	*height=max(lh,rh)+1;
	if(abs(lh-rh)<=1){
		return true;
	}else{
		return false;
	}
}


int main(){

	Node *root=new Node(1);
	root->left=new Node(2);
	root->right=new Node(3);
	root->left->left=new Node(4);
	root->left->right=new Node(5);
	root->right->left=new Node(6);
	root->right->right=new Node(7);

	int height=0;
	if(isBalanvedTree2(root,&height)==true){
		cout<<"it's balanced tree"<<endl;
	}else{
		cout<<"it's not balanced "<<endl;
	}


	return 0;
}