推 DJYOSHITAKA: 大師02/28 11:37
※ 編輯: NCKUEECS (180.217.134.219 臺灣), 02/28/2024 11:41:15
→ NCKUEECS: *BFS 02/28 11:45
513. Find Bottom Left Tree Value
輸出最底層最左邊那個節點的數
雖然是Medium但就是BST寫完就差不多了
int findBottomLeftValue(struct TreeNode* root){
int i, top=0, bot=0, level_size;
struct TreeNode* q[10000] = {NULL};
struct TreeNode* node = root;
q[top++] = node;
while(top!=bot){
level_size = top-bot;
for(i=0; i<level_size; i++){
node = q[bot++];
if(node->left) q[top++] = node->left;
if(node->right) q[top++] = node->right;
}
}
return q[bot-levle_size]->val;
}
快樂樹
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 180.217.134.219 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1709091346.A.214.html