# Tree

- [x 297. Serialize and Deserialize Binary Tree](/top-75-leetcode-questions-to-save-your-time/problems/tree/x-297.-serialize-and-deserialize-binary-tree.md)
- [x 105. Construct Binary Tree from Preorder and Inorder Traversal](/top-75-leetcode-questions-to-save-your-time/problems/tree/x-105.-construct-binary-tree-from-preorder-and-inorder-traversal.md)
- [x 212. Word Search II](/top-75-leetcode-questions-to-save-your-time/problems/tree/x-212.-word-search-ii.md)
- [211. Design Add and Search Words Data Structure](/top-75-leetcode-questions-to-save-your-time/problems/tree/211.-design-add-and-search-words-data-structure.md)
- [208. Implement Trie (Prefix Tree)](/top-75-leetcode-questions-to-save-your-time/problems/tree/208.-implement-trie-prefix-tree.md)
- [235. Lowest Common Ancestor of a Binary Search Tree](/top-75-leetcode-questions-to-save-your-time/problems/tree/235.-lowest-common-ancestor-of-a-binary-search-tree.md)
- [230. Kth Smallest Element in a BST](/top-75-leetcode-questions-to-save-your-time/problems/tree/230.-kth-smallest-element-in-a-bst.md)
- [98. Validate Binary Search Tree](/top-75-leetcode-questions-to-save-your-time/problems/tree/98.-validate-binary-search-tree.md)
- [572. Subtree of Another Tree](/top-75-leetcode-questions-to-save-your-time/problems/tree/572.-subtree-of-another-tree.md)
- [297. Serialize and Deserialize Binary Tree ?](/top-75-leetcode-questions-to-save-your-time/problems/tree/297.-serialize-and-deserialize-binary-tree.md)
- [102. Binary Tree Level Order Traversal](/top-75-leetcode-questions-to-save-your-time/problems/tree/102.-binary-tree-level-order-traversal.md)
- [124. Binary Tree Maximum Path Sum](/top-75-leetcode-questions-to-save-your-time/problems/tree/124.-binary-tree-maximum-path-sum.md)
- [226. Invert Binary Tree](/top-75-leetcode-questions-to-save-your-time/problems/tree/226.-invert-binary-tree.md)
- [100. Same Tree](/top-75-leetcode-questions-to-save-your-time/problems/tree/100.-same-tree.md)
- [104. Maximum Depth of Binary Tree](/top-75-leetcode-questions-to-save-your-time/problems/tree/104.-maximum-depth-of-binary-tree.md)