diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/max_depth_binary_tree.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/max_depth_binary_tree.cpp')
-rw-r--r-- | other/max_depth_binary_tree.cpp | 19 |
1 files changed, 0 insertions, 19 deletions
diff --git a/other/max_depth_binary_tree.cpp b/other/max_depth_binary_tree.cpp deleted file mode 100644 index e5ecc10..0000000 --- a/other/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; - } -}; |