aboutsummaryrefslogtreecommitdiff
path: root/max_depth_binary_tree.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'max_depth_binary_tree.cpp')
-rw-r--r--max_depth_binary_tree.cpp19
1 files changed, 0 insertions, 19 deletions
diff --git a/max_depth_binary_tree.cpp b/max_depth_binary_tree.cpp
deleted file mode 100644
index e5ecc10..0000000
--- a/max_depth_binary_tree.cpp
+++ /dev/null
@@ -1,19 +0,0 @@
-// 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;
- }
-};