Useful things to know about the trees and graphs based data structures:
These:
The big-O deal:
With Java, well tested implementations are mostly available:
These:
- Binary Trees Vs. Binary Search Trees
- 2,4 and Red Black
- AVL
- Tries
- Heaps
- B & B+ Trees
- BFS, DFS
- Sorting - Quick, Merge, Radix, Timsort
- Kruskal's & Prim's algorithm for Minimum Spanning Trees
- Morris Traversal, without extra space or recursion, using Threaded Binary Trees
- Djikstra's algorithm for shortest path
- Topological sorting
The big-O deal:
With Java, well tested implementations are mostly available:
- TreeSet
- TreeMap
- LinkedHashMap
- ConcurrentSkipListMap
- PriorityQueue
No comments:
Post a Comment