maximum_depth_of_binary_tree

Author: hitzzc

README.md

@@ -90,6 +90,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [101. symmetric tree](https://github.com/hitzzc/go-leetcode/tree/master/symmetric_tree)
 #### [102. Binary Tree Level Order Traversal](https://github.com/hitzzc/go-leetcode/tree/master/binary_tree_level_order_traversal)
 #### [103. Binary Tree Zigzag Level Order Traversal](https://github.com/hitzzc/go-leetcode/tree/master/binary_tree_zigzag_level_order_traversal)
+#### [104. maximum depth of binary tree](https://github.com/hitzzc/go-leetcode/tree/master/maximum_depth_of_binary_tree)
 
 
 

maximum_depth_of_binary_tree/maximum_depth_of_binary_tree.go

@@ -0,0 +1,22 @@
+package maximum_depth_of_binary_tree
+
+type TreeNode struct {
+	Val   int
+	Left  *TreeNode
+	Right *TreeNode
+}
+
+func maxDepth(root *TreeNode) int {
+	if root == nil {
+		return 0
+	}
+	if root.Left == nil && root.Right == nil {
+		return 1
+	}
+	left := maxDepth(root.Left)
+	right := maxDepth(root.Right)
+	if left > right {
+		return left + 1
+	}
+	return right + 1
+}