diff --git a/include/s0513_find_bottom_left_tree_value.hpp b/include/s0513_find_bottom_left_tree_value.hpp
new file mode 100644
index 0000000..0b8fa77
--- /dev/null
+++ b/include/s0513_find_bottom_left_tree_value.hpp
@@ -0,0 +1,15 @@
+#ifndef S0513_FIND_BOTTOM_LEFT_TREE_VALUE_HPP
+#define S0513_FIND_BOTTOM_LEFT_TREE_VALUE_HPP
+
+#include <queue>
+
+#include "structures.hpp"
+
+using namespace std;
+
+class S0513 {
+ public:
+  int findBottomLeftValue(TreeNode* root);
+};
+
+#endif
diff --git a/src/s0513_find_bottom_left_tree_value.cpp b/src/s0513_find_bottom_left_tree_value.cpp
new file mode 100644
index 0000000..9657be2
--- /dev/null
+++ b/src/s0513_find_bottom_left_tree_value.cpp
@@ -0,0 +1,20 @@
+#include "s0513_find_bottom_left_tree_value.hpp"
+
+int findBottomLeftValue(TreeNode* root) {
+  int result{0};
+  queue<TreeNode *> q;
+  if (root) q.push(root);
+  int size{0};
+  TreeNode *front = root;
+  while (!q.empty()) {
+    size = q.size();
+    for (int i{0}; i < size; ++i) {
+      front = q.front();
+      q.pop();
+      if (i == 0) result = front->val;
+      if (front->left) q.push(front->left);
+      if (front->right) q.push(front->right);
+    }
+  }
+  return result;
+}