JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

no teams

Browse Source
This commit is contained in:
Jidong Xiao
2023-11-14 13:50:28 -05:00
parent bb89e3f35d
commit 1c5ab12c4a
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
labs/12_stacks_and_queues/README.md
View File

@@ -14,7 +14,7 @@ Level Order Traversal: 1 2 3 4 5 6 7 8
*estimate: 30-40 minutes*
Form a team of two members. Read the code of provided program, and then run the program to see its output. After that, replace the STL queue library with the STL stack library, and implement the queue using two stacks. Do not change the *main* function. Do not change the *levelOrderTraversal* function, except this line:
Read the code of provided program, and then run the program to see its output. After that, replace the STL queue library with the STL stack library, and implement the queue using two stacks. Do not change the *main* function. Do not change the *levelOrderTraversal* function, except this line:
```cpp
std::queue<TreeNode*> myQueue;
@@ -26,7 +26,7 @@ std::queue<TreeNode*> myQueue;
*estimate: 30-40 minutes*
Form a new team of two members. Re-implement the queue using the STL list library. Still, do not change the *main* function, and do not change the *levelOrderTraversal* function, except this line:
Re-implement the queue using the STL list library. Still, do not change the *main* function, and do not change the *levelOrderTraversal* function, except this line:
```cpp
std::queue<TreeNode*> myQueue;