Binary Trees

Types of techniques:

1. Depth First Search

   1. Pre Order Traversal

   2. InOrder Traversal

   3. Post Order Traversal

2. Height of the tree

3. Maximum Width/ Diamater of tree

   1. Handling binary tree problems with imaginary node by indexing

   2. Counting Nodes

4. Lowest Common Ancestor (LCA)

5. Path Sum

6. Children Sum Property

7. Breadth First Search

   1. Breadth First Search (BFS)

   2. Left Side View

   3. Right Side View

   4. BFS with parent node

      1. Nodes at Distance K

      2. Time taken to infect

8. Boundary View

9. Vertical Order Traversal

   1. Top View

   2. Bottom View

10. Symmetrics / Mirror Like Binary Trees

11. Constructing Unique Binary Tree

    1. Construct Binary Tree based on inorder and preorder

    2. Construct Binary Tree based on inorder and postorder

    3. NOTE: Cannot construct BT based on only preorder and postorder

Bookmarks

• https://leetcode.com/discuss/general-discussion/937307/iterative-recursive-dfs-bfs-tree-traversal-in-pre-post-levelorder-views