aboutsummaryrefslogtreecommitdiff
path: root/min_depth_binary_tree.cpp
diff options
context:
space:
mode:
authorjack <[email protected]>2024-06-14 13:13:15 -0600
committerjack <[email protected]>2024-06-14 13:13:15 -0600
commitd343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa (patch)
tree96df922dae2a5073d9a50ea70c7aae6aa37e3ebe /min_depth_binary_tree.cpp
downloadleetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.tar.gz
leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.zip
initial
Diffstat (limited to 'min_depth_binary_tree.cpp')
-rw-r--r--min_depth_binary_tree.cpp34
1 files changed, 34 insertions, 0 deletions
diff --git a/min_depth_binary_tree.cpp b/min_depth_binary_tree.cpp
new file mode 100644
index 0000000..7661fb2
--- /dev/null
+++ b/min_depth_binary_tree.cpp
@@ -0,0 +1,34 @@
+// 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;
+ }
+};