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

re org the paragraphs

Browse Source
This commit is contained in:
Jidong Xiao
2023-11-14 00:32:55 -05:00
parent f8872bdbdc
commit 88ffa4e8b5
1 changed files with 10 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
labs/12_stacks_and_queues/README.md
View File

@@ -1,12 +1,8 @@
# Lab 12 — Stacks and Queues # Lab 12 — Stacks and Queues
In this lab, you will implement queues in different ways, and then fix memory leaks in the provided program. In this lab, you will implement queues in different ways, and then fix memory leaks in the provided program. Start by downloading the provided program [levelOrder.cpp](levelOrder.cpp), and then turn off all network connections.
## Checkpoint 1: The provided program [levelOrder.cpp](levelOrder.cpp) traverses a binary tree by level order. It prints the following message to STDOUT:
*estimate: 30-40 minutes*
Form a team of two members. This [levelOrder.cpp](levelOrder.cpp) program traverses a binary tree by level order. It prints the following message to STDOUT:
```console ```console
Level Order Traversal: 1 2 3 4 5 6 7 Level Order Traversal: 1 2 3 4 5 6 7
@@ -14,22 +10,26 @@ Level Order Traversal: 1 2 3 4 5 6 7 8 9
Level Order Traversal: 1 2 3 4 5 6 7 8 Level Order Traversal: 1 2 3 4 5 6 7 8
``` ```
Read the code, 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: ## Checkpoint 1:
*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:
```cpp ```cpp
queue<TreeNode*> myQueue; std::queue<TreeNode*> myQueue;
``` ```
**To complete this checkpoint**: Show a TA your program, and your test results. Your program should still produce the same results as the original program. And you must be able to explain your program. **To complete this checkpoint**: Show a TA your program, and your test results. Your program should still produce the same results as the original program. And you must be able to explain your program.
## Checkpoint 2: ## Checkpoint 2:
*estimate: 40-50 minutes* *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: 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:
```cpp ```cpp
queue<TreeNode*> myQueue; std::queue<TreeNode*> myQueue;
``` ```
**To complete this checkpoint**: Show a TA your program, and your test results. Your program should still produce the same results as the original program. And you must **To complete this checkpoint**: Show a TA your program, and your test results. Your program should still produce the same results as the original program. And you must