> For the complete documentation index, see [llms.txt](https://wentao-shao.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://wentao-shao.gitbook.io/leetcode/binary-tree.md).

# Binary Tree

- [Serialize And Deserialize](https://wentao-shao.gitbook.io/leetcode/binary-tree/serialize-and-deserialize.md)
- [297.Serialize-and-Deserialize-Binary-Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/serialize-and-deserialize/297.serialize-and-deserialize-binary-tree.md)
- [428.Serialize-and-Deserialize-N-ary-Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/serialize-and-deserialize/428.serialize-and-deserialize-n-ary-tree.md)
- [449.Serialize-and-Deserialize-BST](https://wentao-shao.gitbook.io/leetcode/binary-tree/serialize-and-deserialize/449.serialize-and-deserialize-bst.md)
- [100.Same-Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/100.same-tree.md)
- [101.Symmetric-Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/101.symmetric-tree.md)
- [1038.Binary-Search-Tree-to-Greater-Sum-Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/1038.binary-search-tree-to-greater-sum-tree.md)
- [105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal](https://wentao-shao.gitbook.io/leetcode/binary-tree/105.construct-binary-tree-from-preorder-and-inorder-traversal.md)
- [106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal](https://wentao-shao.gitbook.io/leetcode/binary-tree/106.construct-binary-tree-from-inorder-and-postorder-traversal.md)
- [108.Convert-Sorted-Array-to-Binary-Search-Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/108.convert-sorted-array-to-binary-search-tree.md)
- [1110.Delete-Nodes-And-Return-Forest](https://wentao-shao.gitbook.io/leetcode/binary-tree/1110.delete-nodes-and-return-forest.md)
- [114.Flatten-Binary-Tree-to-Linked-List](https://wentao-shao.gitbook.io/leetcode/binary-tree/114.flatten-binary-tree-to-linked-list.md)
- [1145.Binary-Tree-Coloring-Game](https://wentao-shao.gitbook.io/leetcode/binary-tree/1145.binary-tree-coloring-game.md)
- [116.Populating-Next-Right-Pointers-in-Each-Node](https://wentao-shao.gitbook.io/leetcode/binary-tree/116.populating-next-right-pointers-in-each-node.md)
- [117.Populating-Next-Right-Pointers-in-Each-Node-II](https://wentao-shao.gitbook.io/leetcode/binary-tree/117.populating-next-right-pointers-in-each-node-ii.md)
- [129.Sum-Root-to-Leaf-Numbers](https://wentao-shao.gitbook.io/leetcode/binary-tree/129.sum-root-to-leaf-numbers.md)
- [144.Binary-Tree-Preorder-Traversal](https://wentao-shao.gitbook.io/leetcode/binary-tree/144.binary-tree-preorder-traversal.md)
- [199.Binary-Tree-Right-Side-View](https://wentao-shao.gitbook.io/leetcode/binary-tree/199.binary-tree-right-side-view.md)
- [222.Count-Complete-Tree-Nodes](https://wentao-shao.gitbook.io/leetcode/binary-tree/222.count-complete-tree-nodes.md)
- [226.Invert-Binary-Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/226.invert-binary-tree.md)
- [230.Kth-Smallest-Element-in-a-BST](https://wentao-shao.gitbook.io/leetcode/binary-tree/230.kth-smallest-element-in-a-bst.md)
- [257.Binary-Tree-Paths](https://wentao-shao.gitbook.io/leetcode/binary-tree/257.binary-tree-paths.md)
- [270.Closest-Binary-Search-Tree-Value](https://wentao-shao.gitbook.io/leetcode/binary-tree/270.closest-binary-search-tree-value.md)
- [285.Inorder-Successor-in-BST](https://wentao-shao.gitbook.io/leetcode/binary-tree/285.inorder-successor-in-bst.md)
- [337.House-Robber-III](https://wentao-shao.gitbook.io/leetcode/binary-tree/337.house-robber-iii.md)
- [426.Convert-Binary-Search-Tree-to-Sorted-Doubly-Linked-List](https://wentao-shao.gitbook.io/leetcode/binary-tree/426.convert-binary-search-tree-to-sorted-doubly-linked-list.md)
- [510.Inorder-Successor-in-BST-II](https://wentao-shao.gitbook.io/leetcode/binary-tree/510.inorder-successor-in-bst-ii.md)
- [543.Diameter-of-Binary-Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/543.diameter-of-binary-tree.md)
- [617.Merge-Two-Binary-Trees](https://wentao-shao.gitbook.io/leetcode/binary-tree/617.merge-two-binary-trees.md)
- [652.Find-Duplicate-Subtrees](https://wentao-shao.gitbook.io/leetcode/binary-tree/652.find-duplicate-subtrees.md)
- [653.Two-Sum-IV---Input-is-a-BST](https://wentao-shao.gitbook.io/leetcode/binary-tree/653.two-sum-iv-input-is-a-bst.md)
- [662.Maximum-Width-of-Binary-Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/662.maximum-width-of-binary-tree.md)
- [669.Trim-a-Binary-Search-Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/669.trim-a-binary-search-tree.md)
- [889.Construct-Binary-Tree-from-Preorder-and-Postorder-Traversal](https://wentao-shao.gitbook.io/leetcode/binary-tree/889.construct-binary-tree-from-preorder-and-postorder-traversal.md)
- [938.Range-Sum-of-BST](https://wentao-shao.gitbook.io/leetcode/binary-tree/938.range-sum-of-bst.md)
- [94.Binary-Tree-Inorder-Traversal](https://wentao-shao.gitbook.io/leetcode/binary-tree/94.binary-tree-inorder-traversal.md)
- [951.Flip-Equivalent-Binary-Trees](https://wentao-shao.gitbook.io/leetcode/binary-tree/951.flip-equivalent-binary-trees.md)
- [958.Check-Completeness-of-a-Binary-Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/958.check-completeness-of-a-binary-tree.md)
- [979.Distribute-Coins-in-Binary-Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/979.distribute-coins-in-binary-tree.md)
- [987.Vertical-Order-Traversal-of-a-Binary-Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/987.vertical-order-traversal-of-a-binary-tree.md)
- [Search Range In Binary Search Tree](https://wentao-shao.gitbook.io/leetcode/binary-tree/search-range-in-binary-search-tree.md)