|
|
@@ -802,3 +802,9 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
|
|
|
- inorder (DFS: links, self, regs)
|
|
|
- postorder (DFS: links, regs, self)
|
|
|
- preorder (DFS: self, links, regs)
|
|
|
+
|
|
|
+- ### Binary search trees: BSTs
|
|
|
+ - [ ] [Binary Search Tree Review (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)
|
|
|
+ - [ ] [Introduction (video)](https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction)
|
|
|
+ - [ ] [MIT (video)](https://www.youtube.com/watch?v=76dhtgZt38A&ab_channel=MITOpenCourseWare)
|
|
|
+ - C/C++:
|
Anri Lombard