# Trees

- [Bookmarks](/interview-prep/trees/bookmarks.md)
- [Important Concepts](/interview-prep/trees/important-concepts.md)
- [Depth First Search (DFS)](/interview-prep/trees/depth-first-search-dfs.md)
- [Pre Order Traversal](/interview-prep/trees/depth-first-search-dfs/pre-order-traversal.md)
- [InOrder Traversal](/interview-prep/trees/depth-first-search-dfs/inorder-traversal.md)
- [Post Order Traversal](/interview-prep/trees/depth-first-search-dfs/post-order-traversal.md)
- [Breadth First Search (BFS)](/interview-prep/trees/breadth-first-search-bfs.md): Level Order Traversal
- [Binary Trees](/interview-prep/trees/binary-trees.md)
- [Binary Tree Views](/interview-prep/trees/binary-trees/binary-tree-views.md)
- [Top View](/interview-prep/trees/binary-trees/binary-tree-views/top-view.md)
- [Bottom View](/interview-prep/trees/binary-trees/binary-tree-views/bottom-view.md)
- [Left Side View](/interview-prep/trees/binary-trees/binary-tree-views/left-side-view.md)
- [Right Side View](/interview-prep/trees/binary-trees/binary-tree-views/right-side-view.md)
- [Boundary View](/interview-prep/trees/binary-trees/binary-tree-views/boundary-view.md)
- [Lowest Common Ancestor](/interview-prep/trees/binary-trees/lowest-common-ancestor.md)
- [Construct Binary Tree based on inorder and preorder](/interview-prep/trees/binary-trees/construct-binary-tree-based-on-inorder-and-preorder.md)
- [Construct Binary Tree based on inorder and postorder](/interview-prep/trees/binary-trees/construct-binary-tree-based-on-inorder-and-postorder.md)
- [Binary Search Trees](/interview-prep/trees/binary-search-trees.md)
- [Validating BST](/interview-prep/trees/binary-search-trees/validating-bst.md)
- [Searching BST](/interview-prep/trees/binary-search-trees/searching-bst.md)
- [Inserting Node in BST](/interview-prep/trees/binary-search-trees/inserting-node-in-bst.md)
- [Deleting Node in BST](/interview-prep/trees/binary-search-trees/deleting-node-in-bst.md)
- [Inorder Successor of BST](/interview-prep/trees/binary-search-trees/inorder-successor-of-bst.md)
- [Inorder Successor of BST with duplicate values](/interview-prep/trees/binary-search-trees/inorder-successor-of-bst-with-duplicate-values.md)
- [LCA for BST](/interview-prep/trees/binary-search-trees/lca-for-bst.md)
- [Recover BST](/interview-prep/trees/binary-search-trees/recover-bst.md)
- [Sum of deepest leaves node](/interview-prep/trees/binary-search-trees/sum-of-deepest-leaves-node.md)
- [Convert sorted array into BST](/interview-prep/trees/binary-search-trees/convert-sorted-array-into-bst.md)
- [Convert Sorted Linked List to BST](/interview-prep/trees/binary-search-trees/convert-sorted-linked-list-to-bst.md)
- [Tries](/interview-prep/trees/tries.md)
- [Commonly Used techniques](/interview-prep/trees/tries/commonly-used-techniques.md)
- [Segment Trees](/interview-prep/trees/segment-trees.md)