-
Notifications
You must be signed in to change notification settings - Fork 0
/
104.maximum-depth-of-binary-tree.go
57 lines (54 loc) · 1.02 KB
/
104.maximum-depth-of-binary-tree.go
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
package main
/*
* @lc app=leetcode id=104 lang=golang
*
* [104] Maximum Depth of Binary Tree
*
* https://leetcode.com/problems/maximum-depth-of-binary-tree/description/
*
* algorithms
* Easy (59.40%)
* Total Accepted: 465.3K
* Total Submissions: 783.1K
* Testcase Example: '[3,9,20,null,null,15,7]'
*
* Given a binary tree, find its maximum depth.
*
* The maximum depth is the number of nodes along the longest path from the
* root node down to the farthest leaf node.
*
* Note: A leaf is a node with no children.
*
* Example:
*
* Given binary tree [3,9,20,null,null,15,7],
*
*
* 3
* / \
* 9 20
* / \
* 15 7
*
* return its depth = 3.
*
*/
/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
func maxDepth_104(root *TreeNode) int {
if root == nil {
return 0
}
left := maxDepth_104(root.Left)
right := maxDepth_104(root.Right)
if left > right {
return left + 1
}
return right + 1
}