From 03c35ab2a49dc085d3ef3633d129154b69fc61b6 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Mon, 30 Oct 2023 20:49:18 -0400 Subject: [PATCH] highlight that line --- labs/10_trees_I/README.md | 21 ++++++++++++++++++++- 1 file changed, 20 insertions(+), 1 deletion(-) diff --git a/labs/10_trees_I/README.md b/labs/10_trees_I/README.md index 0689116..34a39b2 100644 --- a/labs/10_trees_I/README.md +++ b/labs/10_trees_I/README.md @@ -10,13 +10,32 @@ problem 2: Create a exactly balanced binary search tree with 7 color words (orde problem 3: Draw a exactly-balanced binary search tree containing the letters of the word: uncopyrightable + + + + + + + + + + What is the pre-order traversal of the tree above? problem 4: Now draw a exactly-balanced binary tree of characters such that a post-order traversal spells the word: uncopyrightable + + + + + + + + + What is the breadth-first traversal of the tree above? -*To complete this checkpoint*: When you have finished all of the problems, discuss your answers with your lab TA or mentor. +**To complete this checkpoint**: When you have finished all of the problems, discuss your answers with your lab TA or mentor. ## Checkpoint 2