Software Engineering Prep

Developer's NotesLog in

LanguagePython

|PatternAll

Level Order BFS<br>Trees

if (root == nullptr) {<br>return {};

std::queueTreeNode*> queue;<br>std::vectorstd::vectorint>> answer;

queue.push(root);

while (!queue.empty()) {<br>int levelSize = queue.size();<br>std::vectorint> level;

for (int i = 0; i levelSize; i++) {<br>TreeNode* node = queue.front();<br>queue.pop();

level.push_back(node->val);

if (node->left != nullptr) {<br>queue.push(node->left);

if (node->right != nullptr) {<br>queue.push(node->right);

answer.push_back(level);

return answer;

Shortcuts<br>Shift+Tab<br>Next snippet<br>Ctrl+Backspace<br>Delete previous word<br>EscReset test

Have feedback? Join the Discord