FilesExpand file tree

 master

/

Coding_025.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

75 lines (63 loc) · 1.24 KB

 master

/

Coding_025.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

75 lines (63 loc) · 1.24 KB

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

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

//二叉树的深度

//题目描述

//

/*

输入一棵二叉树，求该树的深度。

从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径

最长路径的长度为树的深度。

*/

//思路

/*

二叉树遍历

时间复杂度O（N）

空间复杂度O（1）

*/

#include <iostream>

#include <vector>

#include <string>

#include <stack>

#include <queue>

using namespace std;

struct TreeNode {

int val;

struct TreeNode *left;

struct TreeNode *right;

TreeNode(int x) :

val(x), left(NULL), right(NULL) {

}

};

class Solution {

public:

int TreeDepth(TreeNode* pRoot)

{

if (pRoot == NULL)

return 0;

int ldepth = 0;

ldepth +=TreeDepth(pRoot->left)+1;

int rdepth = 0;

rdepth +=TreeDepth(pRoot->right)+1;

return ldepth > rdepth ? ldepth : rdepth;

}

};

void DestoryTree(TreeNode* root)

{

if (!root)

return;

DestoryTree(root->left);

DestoryTree(root->right);

delete root;

}

int main()

{

Solution a;

TreeNode* pRoot = new TreeNode(1);

pRoot->left = new TreeNode(2);

pRoot->right = new TreeNode(3);

pRoot->left->left = new TreeNode(4);

pRoot->left->right = new TreeNode(5);

pRoot->left->left->left = new TreeNode(6);

cout << a.TreeDepth(pRoot) << ' ';

DestoryTree(pRoot);

system("pause");

return 0;

}