xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 12:36:30 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

NULL to nullptr

Browse source
This commit is contained in:
Yudong Jin 2022-11-29 03:21:02 +08:00
parent cce8201e2b
commit 3fc3475af4
2 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
codes/cpp/chapter_tree/binary_tree_bfs.cpp
View file

@ -17,9 +17,9 @@ vector<int> hierOrder(TreeNode* root) {
TreeNode* node = queue.front(); TreeNode* node = queue.front();
queue.pop(); // 队列出队 queue.pop(); // 队列出队
vec.push_back(node->val); // 保存结点 vec.push_back(node->val); // 保存结点
if (node->left != NULL) if (node->left != nullptr)
queue.push(node->left); // 左子结点入队 queue.push(node->left); // 左子结点入队
if (node->right != NULL) if (node->right != nullptr)
queue.push(node->right); // 右子结点入队 queue.push(node->right); // 右子结点入队
} }
return vec; return vec;

4
docs/chapter_tree/binary_tree.md
View file

@ -238,9 +238,9 @@ comments: true
TreeNode* node = queue.front(); TreeNode* node = queue.front();
queue.pop(); // 队列出队 queue.pop(); // 队列出队
vec.push_back(node->val); // 保存结点 vec.push_back(node->val); // 保存结点
if (node->left != NULL) if (node->left != nullptr)
queue.push(node->left); // 左子结点入队 queue.push(node->left); // 左子结点入队
if (node->right != NULL) if (node->right != nullptr)
queue.push(node->right); // 右子结点入队 queue.push(node->right); // 右子结点入队
} }
return vec; return vec;