sainnhe
/
leetcode
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

s0513
ci/woodpecker/push/test Pipeline was successful Details

This commit is contained in:
Sainnhe Park 2023-01-31 12:28:03 +08:00
parent 63f60259ee
commit c442846324
2 changed files with 35 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
include/s0513_find_bottom_left_tree_value.hpp Normal file
View File

@ -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

20
src/s0513_find_bottom_left_tree_value.cpp Normal file
View File

@ -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;
}