Add the code to the docs.

2025-11-02 12:58:42 +08:00 · 2022-12-27 19:33:58 +08:00
parent dbb25003ec
commit 449258f0b0
6 changed files with 81 additions and 54 deletions
--- a/codes/cpp/chapter_tree/binary_tree_bfs.cpp
+++ b/codes/cpp/chapter_tree/binary_tree_bfs.cpp
@ -15,12 +15,12 @@ vector<int> hierOrder(TreeNode* root) {
    vector<int> vec;
    while (!queue.empty()) {
        TreeNode* node = queue.front();
-        queue.pop();  // 队列出队
-        vec.push_back(node->val);            // 保存结点
+        queue.pop();                 // 队列出队
+        vec.push_back(node->val);    // 保存结点
        if (node->left != nullptr)
-            queue.push(node->left);    // 左子结点入队
+            queue.push(node->left);  // 左子结点入队
        if (node->right != nullptr)
-            queue.push(node->right);   // 右子结点入队
+            queue.push(node->right); // 右子结点入队
    }
    return vec;
 }