Presentations
Templates
Features
Teams
Pricing
Log in
Sign up
Log in
Sign up
Menu
Second Half Review
Copyright © 直通硅谷
http://www.zhitongguigu.com
Second Half Review
Tree
Heap
Union Find & Topological Sort
Trie Tree & Segment Tree
Design
Copyright © 直通硅谷
http://www.zhitongguigu.com
Tree
Binary Tree
Morris Traversal
Binary Search Tree
Recursion
Copyright © 直通硅谷
http://www.zhitongguigu.com
Heap
insert
delete
initialize (heapify)
Comparator vs Comparable
Copyright © 直通硅谷
http://www.zhitongguigu.com
Union Find
Parent to itself
Union (Set)
Find (Parent)
Path Compression
Copyright © 直通硅谷
http://www.zhitongguigu.com
Topological Sort
Copyright © 直通硅谷
http://www.zhitongguigu.com
Node
ToList
Indegree
0
Null
2
1
Null
2
2
[3]
1
3
[1]
1
4
[0,1]
0
5
[0,2]
0
Build Graph
ToList
Indegree
BFS (Queue with 0 Ind.)
Trie Tree
Copyright © 直通硅谷
http://www.zhitongguigu.com
Prefix
method
insert
search
Dummy root
Node
List of children
isWord
Segment Tree
Copyright © 直通硅谷
http://www.zhitongguigu.com
Sum/Min/Max/Count of a given range
Storing interval's property of it's children
Node
range
property
start
end
Design
Copyright © 直通硅谷
http://www.zhitongguigu.com
Data Structure
Object Oriented
Database
System
Copyright © 直通硅谷
http://www.zhitongguigu.com
Stay Hungry
Stay Foolish
[GoValley-201612] Final Review
By govalley201612
Source:
ZhiTongGuiGu
[GoValley-201612] Final Review
1,017
govalley201612
More from
govalley201612