Introduction
1.1.
Introduction
Algorithm and Data Structure
2.1.
Algorithm
2.1.1.
Complexity
2.1.2.
Search
2.1.2.1.
BFS
2.1.2.2.
DFS
2.1.3.
Sort
2.1.3.1.
Bubble Sort
2.1.3.2.
Selection sort
2.1.3.3.
Insertion Sort
2.1.3.4.
Bucket Sort
2.1.3.5.
Counting Sort
2.1.3.6.
Merge Sort
2.1.3.7.
Quick Sort
2.1.3.8.
Binary tree sort
2.1.3.9.
Radix sort
2.1.3.10.
Shell Sort
2.1.4.
Graph Theory
2.1.4.1.
Huffman Coding
2.1.4.2.
Tree traversal
2.1.4.2.1.
Breadth First Search
2.1.4.2.2.
Depth First Search
2.1.4.2.2.1.
Pre-order
2.1.4.2.2.2.
In-order
2.1.4.2.2.3.
Post-order
2.1.4.3.
DAG
2.1.4.4.
Shortest path problem
2.1.4.5.
Minimum spanning tree
2.1.4.6.
Network flow
2.1.5.
Greedy
2.1.5.1.
Fractional Knapsack Problem
2.1.6.
Dynamic Programming
2.1.6.1.
0-1 Knapsack Problem
2.1.6.2.
Coin Change
2.1.7.
Divide and Conquer
2.1.7.1.
quickSelect + median of medians + quickSort
2.2.
Data Structure
2.2.1.
Array
2.2.2.
Heap
2.2.3.
Stack
2.2.4.
Queue
2.2.5.
Linked List
2.2.6.
Tree
2.2.6.1.
BIT (Binary Index Tree)
2.2.7.
Graph
System Design
3.1.
Singleton Pattern
Programing languages
4.1.
Java
4.1.1.
Iterate List, Map, ArrayList
4.1.2.
Sort Map(Java 8)
4.1.3.
静态方法和实例方法的区别
4.1.4.
Java Platform Roles
Database
5.1.
Database
Basic Skills
6.1.
Git Complete
6.1.1.
Git
6.1.2.
Gitbook
6.2.
Emacs + Org-mode
6.2.1.
Org-mode
Courses
7.1.
CSCI572 Information Retrieval
7.1.1.
Search Engine Basics
7.1.2.
Characterizing the Web(Web Trends and Measurements)
7.1.3.
Search Engine Evaluation
7.1.4.
Crawling in One
7.1.5.
Identifying Duplicates
7.1.6.
Introduction to Information Retrieval
7.1.7.
Lexicon & Text Normalization
7.1.8.
Discussion of Homework #2
7.1.9.
Inverted Indexing
7.1.10.
YouTube Search Engine
7.1.11.
Discussion of Homework #2
7.1.12.
Page Rank
Powered by
GitBook
Depth First Search
Binary Tree Traversals
Reference Linked 1
Option name
recursive
Stack
Morris
Preorder (Root, Left, Right)
Inorder (Left, Root, Right
Postorder(Left, Right, Root)
Time Complexity
O(n)
O(n)
Space Complexity
O(n)
O(n)
O(1)
results matching "
"
No results matching "
"