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

# Binary Tree classic

- [333. Largest BST Subtree](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/333.-largest-bst-subtree.md)
- [965. Univalued Binary Tree](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/965.-univalued-binary-tree.md)
- [1110. Delete Nodes And Return Forest](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/1110.-delete-nodes-and-return-forest.md)
- [450. Delete Node in a BST](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/450.-delete-node-in-a-bst.md)
- [1028. Recover a Tree From Preorder Traversal](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/1028.-recover-a-tree-from-preorder-traversal.md)
- [109. Convert Sorted List to Binary Search Tree](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/109.-convert-sorted-list-to-binary-search-tree.md)
- [919. Complete Binary Tree Inserter](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/919.-complete-binary-tree-inserter.md)
- [BS DFS enhancement](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/bs-dfs-enhancement.md)
- [107. Binary Tree Level Order Traversal II](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/bs-dfs-enhancement/107.-binary-tree-level-order-traversal-ii.md)
- [814. Binary Tree Pruning](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/bs-dfs-enhancement/814.-binary-tree-pruning.md)
- [979. Distribute Coins in Binary Tree](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/bs-dfs-enhancement/979.-distribute-coins-in-binary-tree.md)
- [1325. Delete Leaves With a Given Value](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/bs-dfs-enhancement/1325.-delete-leaves-with-a-given-value.md)
- [106. Construct Binary Tree from Inorder and Postorder Traversal](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/106.-construct-binary-tree-from-inorder-and-postorder-traversal.md)
- [105. Construct Binary Tree from Preorder and Inorder Traversal](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/105.-construct-binary-tree-from-preorder-and-inorder-traversal.md)
- [889. Construct Binary Tree from Preorder and Postorder Traversal](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/889.-construct-binary-tree-from-preorder-and-postorder-traversal.md)
- [226. Invert Binary Tree](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/226.-invert-binary-tree.md)
- [116. Populating Next Right Pointers in Each Node](https://timmybeeflin.gitbook.io/cracking-leetcode/tree/binary-tree-classic/116.-populating-next-right-pointers-in-each-node.md)