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

Adds video description.

This commit is contained in:
John Washam 2022-09-09 17:28:12 -07:00
parent 28c27f5b3f
commit c34a2828a3
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
README.md
View File

@ -760,8 +760,8 @@ if you can identify the runtime complexity of different algorithms. It's a super
## Trees
- ### Trees - Intro
- [ ] [Intro to Trees](https://www.coursera.org/lecture/data-structures/trees-95qda)
- [ ] [Tree Traversal](https://www.coursera.org/lecture/data-structures/tree-traversal-fr51b)
- [ ] [Intro to Trees (video)](https://www.coursera.org/lecture/data-structures/trees-95qda)
- [ ] [Tree Traversal (video)](https://www.coursera.org/lecture/data-structures/tree-traversal-fr51b)
- [ ] [BFS(breadth-first search) and DFS(depth-first search) (video)](https://www.youtube.com/watch?v=uWL6FJhq5fM)
- BFS notes:
- level order (BFS, using queue)