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/min_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/min_depth_binary_tree.cpp')
-rw-r--r-- | other/min_depth_binary_tree.cpp | 34 |
1 files changed, 0 insertions, 34 deletions
diff --git a/other/min_depth_binary_tree.cpp b/other/min_depth_binary_tree.cpp deleted file mode 100644 index 7661fb2..0000000 --- a/other/min_depth_binary_tree.cpp +++ /dev/null @@ -1,34 +0,0 @@ -// 111. Minimum Depth of Binary Tree -#include "leetcode.h" - -/* - * given a binary tree, find its minimum depth. the minimum depth is the number - * of nodes along the shortest path from the root node down to the nearest leaf - * node. note: a leaf is a node with no children. - */ - -class Solution { -public: - int minDepth(TreeNode *root) { - if (!root) - return 0; - queue<TreeNode *> q; - q.push(root); - int i = 0; - while (!q.empty()) { - i++; - int k = q.size(); - for (int j = 0; j < k; j++) { - TreeNode *rt = q.front(); - if (rt->left) - q.push(rt->left); - if (rt->right) - q.push(rt->right); - q.pop(); - if (!rt->left && !rt->right) - return i; - } - } - return -1; - } -}; |