FilesExpand file tree

master

/

Balanced_Binary_Tree.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

42 lines (32 loc) · 682 Bytes

master

/

Balanced_Binary_Tree.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

42 lines (32 loc) · 682 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

#include <iostream>

#include <cstdio>

using namespace std;

struct TreeNode {

int val;

TreeNode *left;

TreeNode *right;

TreeNode(int x) : val(x), left(NULL), right(NULL) {}

};

int getHeight(TreeNode * pNode) {

if (pNode == NULL) {

return 0;

}

int lh = getHeight(pNode->left);

int rh = getHeight(pNode->right);

return max(lh, rh) + 1;

}

bool isBalanced (TreeNode * root) {

if (root == NULL) return true;

int lh = getHeight(root->left);

int rh = getHeight(root->right);

if (lh - rh > 1 || lh - rh < -1) {

return false;

}

if (isBalanced(root->left) && isBalanced(root->right)) {

return true;

}

return false;

}

int main(){

return 0;

}