From 7c60dee83b436e8e8a667bf9f191beced8de4fc3 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Mon, 10 Mar 2025 00:36:13 -0600 Subject: chore: move cpp and rust code to directory --- other/min_depth_binary_tree.cpp | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 other/min_depth_binary_tree.cpp (limited to 'other/min_depth_binary_tree.cpp') diff --git a/other/min_depth_binary_tree.cpp b/other/min_depth_binary_tree.cpp new file mode 100644 index 0000000..7661fb2 --- /dev/null +++ b/other/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 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; + } +}; -- cgit v1.2.3