aboutsummaryrefslogtreecommitdiff
path: root/other/max_depth_binary_tree.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'other/max_depth_binary_tree.cpp')
-rw-r--r--other/max_depth_binary_tree.cpp19
1 files changed, 19 insertions, 0 deletions
diff --git a/other/max_depth_binary_tree.cpp b/other/max_depth_binary_tree.cpp
new file mode 100644
index 0000000..e5ecc10
--- /dev/null
+++ b/other/max_depth_binary_tree.cpp
@@ -0,0 +1,19 @@
+// 104. Maximum Depth of Binary Tree
+#include "leetcode.h"
+
+/*
+ * given the 'root' of a binary tree, return its maximum depth. a binary tree's
+ * max depth is the number of nodes along the longest path from the root node
+ * down to the farthest leaf node.
+ */
+
+class Solution {
+public:
+ int maxDepth(TreeNode *root) {
+ if (!root)
+ return 0;
+ int max_left = maxDepth(root->left);
+ int max_rght = maxDepth(root->right);
+ return max(max_left, max_rght) + 1;
+ }
+};