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

Improve wording of C1Q3 in Lab8

Browse Source
This commit is contained in:
Corbin
2025-03-30 14:37:39 -04:00
committed by JamesFlare
parent 28f18a41a3
commit 2b01a1987d
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
labs/trees_I/README.md
View File

@@ -8,15 +8,15 @@ Pair up with one other student in your lab section and complete the exercises be
problem 1: Draw a binary tree with 4 levels with the integers 1-7 such that the sum of elements on every level of the tree is the same. problem 1: Draw a binary tree with 4 levels with the integers 1-7 such that the sum of elements on every level of the tree is the same.
problem 2: Create a exactly balanced binary search tree with 7 color words (order the colors alphabetically). problem 2: Create an exactly balanced binary search tree with 7 color words (order the colors alphabetically).
problem 3: Arrange the following items of clothing in a tree with 3 levels such that the parent of every node is generally donned before the child when dressing in the morning: jacket, pants, shoes, shirt, undergarments, socks, and belt. problem 3: Arrange the following items of clothing in a tree with 3 levels such that the parent of every node is generally donned before the child when dressing in the morning and nodes at the same level could be donned in any order: jacket, pants, shoes, shirt, undergarments, socks, and belt.
problem 4: Draw a binary search tree with the integers 1-7, where 3 has no parent and 5 has no children, and there are no other elements at the same level as 5. problem 4: Draw a binary search tree with the integers 1-7, where 3 has no parent and 5 has no children, and there are no other elements at the same level as 5.
problem 5: What is the sum of the leaf nodes in a perfectly balanced binary search tree containing the powers of 2 less than 128? problem 5: What is the sum of the leaf nodes in a perfectly balanced binary search tree containing the powers of 2 less than 128?
problem 6: Draw a exactly-balanced binary search tree containing the letters of the word: uncopyrightable problem 6: Draw an exactly-balanced binary search tree containing the letters of the word: uncopyrightable
   
   
@@ -28,7 +28,7 @@ problem 6: Draw a exactly-balanced binary search tree containing the letters of
What is the pre-order traversal of the tree above? What is the pre-order traversal of the tree above?
problem 7: Now draw a exactly-balanced binary tree of characters such that a post-order traversal spells the word: uncopyrightable problem 7: Now draw an exactly-balanced binary tree of characters such that a post-order traversal spells the word: uncopyrightable