silva
/
ctci
mirror of https://github.com/viniciusfdasilva/ctci.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

small formatting update

This commit is contained in:
anebz 2019-10-12 20:59:02 +02:00
parent f6e65507f1
commit 2a40eebc1c
2 changed files with 5 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
03. Stacks and queues/3.1. 3stacks_in_array.md
View File

@ -1,4 +1,4 @@
# Three in one # 3.1. Three in one
> Describe how you could use a single array to implement three stacks. > Describe how you could use a single array to implement three stacks.

5
18. Advanced topics/README.md
View File

@ -139,4 +139,7 @@ This is the mirror image of the prior case.
<img src="img/avl3.png" width="500"> <img src="img/avl3.png" width="500">
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. 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.
## 18.7. Red-black trees
Pages 639-642 on the CTCI book.