leetcode hot100题解

https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/description/?envType=study-plan

https://leetcode.cn/problems/path-sum-iii/?envType=study-plan-v2&envId=top-100-liked

https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/?

https://leetcode.cn/problems/binary-tree-right-side-view/description/?envType=study-plan-v2&envId=to

https://leetcode.cn/problems/flatten-binary-tree-to-linked-list/description/?envType=study-plan-v2&e

https://leetcode.cn/problems/kth-smallest-element-in-a-bst/?envType=study-plan-v2&envId=top-100-like

https://leetcode.cn/problems/validate-binary-search-tree/description/?envType=study-plan-v2&envId=to

https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/?envType=study-plan-v2&envId

https://leetcode.cn/problems/binary-tree-level-order-traversal/description/?envType=study-plan-v2&en

https://leetcode.cn/problems/symmetric-tree/description/?envType=study-plan-v2&envId=top-100-liked

https://leetcode.cn/problems/diameter-of-binary-tree/description/?envType=study-plan-v2&envId=top-10

https://leetcode.cn/problems/invert-binary-tree/description/?envType=study-plan-v2&envId=top-100-lik

二叉树的遍历算法主要分为递归遍历和层序遍历两种，都有代码模板。递归代码模板可以延伸出后面要讲的 DFS 算法、回溯算法，层序代码模板可以延伸出后面要讲的 BFS 算法。

https://leetcode.cn/problems/spiral-matrix/description/?envType=study-plan-v2&envId=top-100-liked

https://leetcode.cn/problems/set-matrix-zeroes/description/?envType=study-plan-v2&envId=top-100-like

https://leetcode.cn/problems/copy-list-with-random-pointer/description/?envType=study-plan-v2&envId=

https://leetcode.cn/problems/reverse-nodes-in-k-group/description/?envType=study-plan-v2&envId=top-1

https://leetcode.cn/problems/swap-nodes-in-pairs/description/?envType=study-plan-v2&envId=top-100-li

https://leetcode.cn/problems/remove-nth-node-from-end-of-list/?envType=study-plan-v2&envId=top-100-l

https://leetcode.cn/problems/sort-list/description/?envType=study-plan-v2&envId=top-100-liked