mirrors/coding-interview-university
mirrors
/
coding-interview-university
mirror of https://github.com/jwasham/coding-interview-university.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Fixed spacing

This commit is contained in:
John Washam 2016-07-05 14:18:09 -07:00
parent 0392c3d0ca
commit 5e3bf1904b
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
README.md
View File

@ -406,10 +406,10 @@ Then test it out on a computer to make sure it's not buggy from syntax.
- Know least one type of balanced binary tree (and know how it's implemented):
- [x] **AVL trees**
-[x] MIT: https://www.youtube.com/watch?v=FNeL18KsWPc&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=6
-[x] https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees
-[x] https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation
-[x] https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge
- [x] MIT: https://www.youtube.com/watch?v=FNeL18KsWPc&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=6
- [x] https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees
- [x] https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation
- [x] https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge
- [ ] **red/black trees**
- https://class.coursera.org/algs4partI-010/lecture/50