diff --git a/03. Stacks and queues/3.1. 3stacks_in_array.md b/03. Stacks and queues/3.1. 3stacks_in_array.md index d5bfdee..aa9667f 100644 --- a/03. Stacks and queues/3.1. 3stacks_in_array.md +++ b/03. Stacks and queues/3.1. 3stacks_in_array.md @@ -1,4 +1,4 @@ -# Three in one +# 3.1. Three in one > Describe how you could use a single array to implement three stacks. diff --git a/18. Advanced topics/README.md b/18. Advanced topics/README.md index f6d4ba2..6eb6555 100644 --- a/18. Advanced topics/README.md +++ b/18. Advanced topics/README.md @@ -139,4 +139,7 @@ This is the mirror image of the prior case. In both cases, "balanced" means that the balance of the tree is between -1 and 1, not that it's 0. We recurse up the tree, fixing any imbalances. If we ever achieve a balance=0, we know there are no imbalances anymore. This portion of the tree won't cause another higher subtree to have a balance of -2/2. If we were doing this non-recursively, then we could break from the loop. - \ No newline at end of file + +## 18.7. Red-black trees + +Pages 639-642 on the CTCI book.