Data Struture 61
- 501-find-mode-in-binary-search-tree
- 98-validate-binary-search-tree
- 530-minimum-absolute-difference-in-bst
- 700-search-in-a-binary-search-tree
- 617-Merge-Two-Binary-Trees
- 654-maximum-binary-tree
- 112-path-sum
- 513-Find Bottom Left Tree Value
- 404-sum-of-left-leaves
- 257-binary-tree-paths
- 110-balanced-binary-tree
- 222-count-complete-tree-nodes
- 101-symmetric-tree
- 226-invert-binary-tree
- 111-minimum-depth-of-binary-tree
- 104-maximum-depth-of-binary-tree
- 116-populating-next-right-pointers-in-each-node
- 515-find-largest-value-in-each-tree-row
- 429-n-ary-tree-level-order-traversal
- 637-average-of-levels-in-binary-tree
- 199-binary-tree-right-side-view
- 107-binary-tree-level-order-traversal-ii
- 102-binary-tree-level-order-traversal
- Recursion 递归
- 145-binary-tree-postorder-traversal
- 94-binary-tree-Inorder-traversal
- 144-binary-tree-preorder-traversal
- 347-top-k-frequent-elements
- 239-sliding-window-maximum
- 1047-remove-all-adjacent-duplicates-in-string
- 150-evaluate-reverse-polish-notation
- Python Deque
- 20-valid-parentheses
- 225-implement-stack-using-queues
- 232-implement-queue-using-stacks
- 28-find-the-index-of-the-first-occurrence-in-a-string
- 151-reverse-words-in-a-string
- 541-reverse-string-ii
- 344-reverse-string
- 18-4Sum
- 15-3Sum
- 383-ransom-note
- 454-4-sum-ii
- 202-happy-number
- 1-two-sum
- 349-intersection-of-two-arrays
- 242-valid-anagram
- 142-linked-list-cycle-ii
- 19-remove-nth-node-from-end-of-list
- 24-swap-nodes-in-pairs
- 160-intersection-of-two-linked-lists
- 206-reverse-linked-list
- 707-design-linked-list
- 203-remove-linked-list-elements
- 59-spiral-matrix-ii
- 58 length-of-last-word
- 27 Move Element
- 26 remove-duplicates-from-sorted-array
- 704 Binary Search
- 209 minimum-size-subarray-sum
- 977 squares-of-a-sorted-array