This repository contains programming questions based on Trees.
- Implement Binary Tree
- Preorder/ Inorder/ PostOrder / Level Order Traversal: https://leetcode.com/problems/binary-tree-level-order-traversal/
- Height of binary tree : https://leetcode.com/problems/maximum-depth-of-binary-tree/
- Minimum Depth of binary tree: https://leetcode.com/problems/minimum-depth-of-binary-tree/
- Maximum width of binary tree: https://leetcode.com/problems/maximum-width-of-binary-tree/
- Diameter of Binary Tree : https://leetcode.com/problems/diameter-of-binary-tree/
- Check tree is balanced or not : https://leetcode.com/problems/balanced-binary-tree/
- Check Sum tree or not: https://practice.geeksforgeeks.org/problems/sum-tree/1
- Check tree is mirror image of other tree or not: https://leetcode.com/problems/symmetric-tree/
- Determine if Two Trees are Identical: https://practice.geeksforgeeks.org/problems/determine-if-two-trees-are-identical/1
- Sum of Longest Bloodline of tree: https://practice.geeksforgeeks.org/problems/sum-of-the-longest-bloodline-of-a-tree/1
- LCA in a Binary tree: https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-binary-tree/1 https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/
- K Sum Path in a tree: https://practice.geeksforgeeks.org/problems/k-sum-paths/1
- Max sum of non-adjacent nodes in a tree: https://practice.geeksforgeeks.org/problems/maximum-sum-of-non-adjacent-nodes/1
- Zig-Zag traversal of tree: https://practice.geeksforgeeks.org/problems/zigzag-tree-traversal/1
- Vertical Order traversal of a tree: https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/
- Top/ Bottom/ Left/ Right View of a tree: https://practice.geeksforgeeks.org/problems/top-view-of-binary-tree/1 https://practice.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1 https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1 https://practice.geeksforgeeks.org/problems/right-view-of-binary-tree/1
- Construct tree from PreOrder and Inorder traversal: https://practice.geeksforgeeks.org/problems/construct-tree-1/1 https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
- Construct tree from Inorder and Postorder traversal: https://www.geeksforgeeks.org/problems/tree-from-postorder-and-inorder/1 https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/
- Minimum time to burn binary tree: https://practice.geeksforgeeks.org/problems/burning-tree/1
- Morris traversal: https://www.geeksforgeeks.org/morris-traversal-for-preorder/
- Diagonal traversal: https://practice.geeksforgeeks.org/problems/diagonal-traversal-of-binary-tree/1
- Boundary traversal: https://practice.geeksforgeeks.org/problems/boundary-traversal-of-binary-tree/1
- Flatten a Binary tree to list: https://leetcode.com/problems/flatten-binary-tree-to-linked-list/
- Populating Next Right Pointers in Each Node: https://leetcode.com/problems/populating-next-right-pointers-in-each-node/