diff options
| author | mo khan <mo.khan@gmail.com> | 2020-08-27 13:19:36 -0600 |
|---|---|---|
| committer | mo khan <mo.khan@gmail.com> | 2020-08-27 13:19:36 -0600 |
| commit | e040e02be99542465affa55e2676b1b6ce938133 (patch) | |
| tree | 2e5ac58712c7e03d9fc98d5dbffbe60446b23d36 | |
| parent | 74a52d20b88b61bc481e6940dcdb70215f068f7f (diff) | |
Add link to lecture video
| -rw-r--r-- | doc/unit/09/README.md | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/doc/unit/09/README.md b/doc/unit/09/README.md index 23ae46f..1ee9d51 100644 --- a/doc/unit/09/README.md +++ b/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 |