Reading notes of book Algorithm(4th Algorithm),ISBN: 9787115293800. All java realization codes are placed in different packages.

• Selection
• Insertion
• Shell
• Merge
• QuickSort
• Priority Queue

I started learning the data struture systematically, I will list my notes in the order that I read the book.

1. Binary Tree
2. Complete Binary Tree
3. Balanced Binary Tree
4. Black Red Tree
5. B Tree series

• Blocking Queue

1. Array Blocking Queue
2. Linked Blocking Queue
3. Priority Blocking Queue
4. Delay Queue

• Non Blocking Queue

1. ConcurrentLinkedQueue

1. HashMap
2. ConcurrentHashMap

1. Undirected Graph
2. Directed Graph
3. Minimun Spanning Trees
4. Shortest Path

This part I listed my leetcode solutions.

1. Array and String. (Question1_*)
2. List. (Question2_*)
3. Stack and Queue. (Question3_*)
4. Tree and Graph. (Question4_*)
5. Bit Operations. (Question5_*)
6. Recursive and Dynamic programming. (Question9_*)