FilesExpand file tree

 master

/

maximum_depth_of_binary_tree_104.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

38 lines (36 loc) · 773 Bytes

 master

/

maximum_depth_of_binary_tree_104.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

38 lines (36 loc) · 773 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

/**

* Definition for a binary tree node.

* struct TreeNode {

* int val;

* TreeNode *left;

* TreeNode *right;

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

* };

*/

class Solution {

public:

void findMax(TreeNode* root, int& depth, int level)

{

if (!root)

return;

if (depth < level + 1)

depth ++;

findMax(root->left, depth, level + 1);

findMax(root->right, depth, level + 1);

}

int maxDepth(TreeNode* root) {

if (!root)

return 0;

int res = 0;

findMax(root, res, 0);

return res;

}

};

//another elegant solution

class Solution {

public:

int maxDepth(TreeNode* root) {

if(!root) return 0;

return max(maxDepth(root->left),maxDepth(root->right)) + 1;

}

};