| 0144 | Binary Tree Preorder Traversal | [[LeetCode XXXX]] | Stack, Tree, Depth-First Search, Binary Tree | Easy |
| 0094 | Binary Tree Inorder Traversal | [[LeetCode XXXX]] | Stack, Tree, Depth-First Search, Binary Tree | Easy |
| 0145 | Binary Tree Postorder Traversal | [[LeetCode XXXX]] | Stack, Tree, Depth-First Search, Binary Tree | Easy |
| 0102 | Binary Tree Level Order Traversal | [[LeetCode XXXX]] | Tree, Breadth-First Search, Binary Tree | Medium |
| 0103 | Binary Tree Zigzag Level Order Traversal | [[LeetCode XXXX]] | Tree, Breadth-First Search, Binary Tree | Medium |
| 0107 | Binary Tree Level Order Traversal II | [[LeetCode XXXX]] | Tree, Breadth-First Search, Binary Tree | Medium |
| 0104 | Maximum Depth of Binary Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy |
| 0111 | Minimum Depth of Binary Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy |
| 0124 | Binary Tree Maximum Path Sum | [[LeetCode XXXX]] | Tree, Depth-First Search, Dynamic Programming, Binary Tree | Hard |
| 0101 | Symmetric Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy |
| 0112 | Path Sum | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy |
| 0113 | Path Sum II | [[LeetCode XXXX]] | Tree, Depth-First Search, Backtracking, Binary Tree | Medium |
| 0236 | Lowest Common Ancestor of a Binary Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Binary Tree | Medium |
| 0199 | Binary Tree Right Side View | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium |
| 0226 | Invert Binary Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy |
| 0958 | Check Completeness of a Binary Tree | [[LeetCode XXXX]] | Tree, Breadth-First Search, Binary Tree | Medium |
| 0572 | Subtree of Another Tree | | Tree, Depth-First Search, Binary Tree, String Matching, Hash Function | Easy |
| 0100 | Same Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy |
| 0116 | Populating Next Right Pointers in Each Node | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Linked List, Binary Tree | Medium |
| 0117 | Populating Next Right Pointers in Each Node II | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Linked List, Binary Tree | Medium |
| 0297 | Serialize and Deserialize Binary Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Design, String, Binary Tree | Hard |
| 0114 | Flatten Binary Tree to Linked List | | Stack, Tree, Depth-First Search, Linked List, Binary Tree | Medium |
