gaspersic/coding-interview-university
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Organizing tree study

Browse Source
This commit is contained in:
John Washam 2016-06-25 17:19:49 -07:00
parent e616c2c14d
commit c4d139621b
1 changed files with 20 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
plan.txt
View File

@ -323,38 +323,37 @@ Then test it out on a computer to make sure it's not buggy from syntax.
- http://bits.stephan-brumme.com/absInteger.html - http://bits.stephan-brumme.com/absInteger.html
* - Parity & Hamming Code: * - Parity & Hamming Code:
Parity: * - Parity:
https://www.youtube.com/watch?v=DdMcAUlxh1M - https://www.youtube.com/watch?v=DdMcAUlxh1M
Hamming Code: * - Hamming Code:
https://www.youtube.com/watch?v=1A_NcXxdoCc - Error detection: https://www.youtube.com/watch?v=1A_NcXxdoCc
https://www.youtube.com/watch?v=JAMLuxdHH8o - Error correction: https://www.youtube.com/watch?v=JAMLuxdHH8o
Error Checking: * - Error Checking:
https://www.youtube.com/watch?v=wbH2VxzmoZk - https://www.youtube.com/watch?v=wbH2VxzmoZk
----------------------------------------------------- -----------------------------------------------------
Trees Trees
----------------------------------------------------- -----------------------------------------------------
Notes: Notes:
- https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/ovovP/core-trees - Series: https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/ovovP/core-trees
- https://class.coursera.org/algs4partI-010/lecture - Series: https://www.coursera.org/learn/data-structures/lecture/95qda/trees
- basic tree construction - basic tree construction
- traversal - traversal
- manipulation algorithms - manipulation algorithms
- BFS (breadth-first search) - BFS (breadth-first search)
- DFS (depth-first search) - DFS (depth-first search)
- know the difference between - know the difference between these:
- inorder - inorder (DFS: left, self, right)
- postorder - postorder (DFS: left, right, self)
- preorder - preorder (DFS: self, left, right)
- level order (BFS, using queue)
- Binary trees:
- https://www.coursera.org/learn/data-structures/lecture/GRV2q/binary-trees
- Binary search trees: BSTs - Binary search trees: BSTs
- Series: https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/p82sw/core-introduction-to-binary-search-trees
- Series: https://class.coursera.org/algs4partI-010/lecture/43
- starts with symbol table and goes through BST applications
- https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction - https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction
- https://www.youtube.com/watch?v=pYT9F8_LFTM - https://www.youtube.com/watch?v=pYT9F8_LFTM
- applications:
- https://class.coursera.org/algs4partI-010/lecture/57
- N-ary trees - N-ary trees
- https://en.wikipedia.org/wiki/K-ary_tree - https://en.wikipedia.org/wiki/K-ary_tree
@ -449,6 +448,9 @@ Implement:
Insertion Sort Insertion Sort
Selection Sort Selection Sort
For Curiosity:
Radix Sort: https://www.youtube.com/watch?v=xhr26ia4k38
----------------------------------------------------- -----------------------------------------------------
More Knowledge More Knowledge
----------------------------------------------------- -----------------------------------------------------