Commit e040e02

mo khan <mo.khan@gmail.com>
2020-08-27 19:19:36
Add link to lecture video
master
1 parent 74a52d2
Changed files (1)
doc
unit
09
README.md
doc/unit/09/README.md
@@ -11,6 +11,8 @@ lemma:
 
 # Red-Black Trees
 
+[Lecture Video](https://www.youtube.com/watch?v=JMZkuYa04tY)
+
 * A binary search tree with logarithmic height.
 
 1. tree with `n` values has a height of most 2logn