From 5e3bf1904b4cde22bb7249a3be7efd8e5361cdb2 Mon Sep 17 00:00:00 2001 From: John Washam Date: Tue, 5 Jul 2016 14:18:09 -0700 Subject: [PATCH] Fixed spacing --- README.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index 5051cb1..7821cfc 100644 --- a/README.md +++ b/README.md @@ -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