Binary Tree problems

72 Binary Tree DSA practice problems on CampusCode, each with statement, examples and constraints.

• 835. Inorder Traversal of Binary Tree Easy Trees
• 836. Preorder Traversal of Binary Tree Easy Trees
• 837. Postorder Traversal of Binary Tree Easy Trees
• 838. Level Order Traversal (BFS) Easy Trees
• 839. Height / Maximum Depth of Binary Tree Easy Trees
• 840. Minimum Depth of Binary Tree Easy Trees
• 841. Count Total Nodes in Binary Tree Easy Trees
• 842. Count Leaf Nodes Easy Trees
• 843. Sum of All Nodes Easy Trees
• 844. Check if Two Trees are Identical Easy Trees
• 845. Mirror / Invert a Binary Tree Easy Trees
• 846. Check if Binary Tree is Symmetric Easy Trees
• 847. Check if Binary Tree is Balanced Easy Trees
• 848. Diameter of Binary Tree Easy Trees
• 849. Maximum Path Sum Root to Leaf Easy Trees
• 850. Check if Path with Given Sum Exists Easy Trees
• 851. Find All Root-to-Leaf Paths Easy Trees
• 852. Left View of Binary Tree Easy Trees
• 853. Right View of Binary Tree Easy Trees
• 854. Top View of Binary Tree Easy Trees
• 855. Bottom View of Binary Tree Easy Trees
• 856. Zigzag Level Order Traversal Easy Trees
• 857. Boundary Traversal of Binary Tree Easy Trees
• 858. Vertical Order Traversal Easy Trees
• 859. Check if Binary Tree is Complete Easy Trees
• 860. Check if Binary Tree is Full Easy Trees
• 861. Check if Binary Tree is Perfect Easy Trees
• 862. Find Maximum Width of Binary Tree Easy Trees
• 863. Find Lowest Common Ancestor (LCA) Easy Trees
• 864. Find Distance Between Two Nodes Easy Trees
• 865. Print Nodes at Distance K from Root Easy Trees
• 866. Find Level of a Node in Binary Tree Easy Trees
• 867. Check if Leaf Nodes are at Same Level Easy Trees
• 868. Convert Binary Tree to its Mirror Easy Trees
• 869. Sum of Nodes on Longest Path Root to Leaf Easy Trees
• 870. Count Half Nodes in Binary Tree Easy Trees
• 871. Find the Deepest Left Leaf Node Easy Trees
• 872. Find Maximum Level Sum in Binary Tree Easy Trees
• 873. Connect Level Order Siblings (Next Pointer) Easy Trees
• 874. Iterative Inorder Traversal Using Stack Easy Trees
• 895. Binary Tree Maximum Path Sum Medium Trees
• 896. Construct Binary Tree from Preorder and Inorder Medium Trees
• 897. Construct Binary Tree from Postorder and Inorder Medium Trees
• 898. Flatten Binary Tree to Linked List Medium Trees
• 899. Populating Next Right Pointers in Each Node Medium Trees
• 900. Binary Tree Right Side View Medium Trees
• 901. Sum Root to Leaf Numbers Medium Trees
• 902. Path Sum II — All Root-to-Leaf Paths Medium Trees
• 903. Path Sum III — Any Downward Path Medium Trees
• 904. Count Good Nodes in Binary Tree Medium Trees
• 905. All Nodes Distance K in Binary Tree Medium Trees
• 906. Find Duplicate Subtrees Medium Trees
• 907. Maximum Difference Between Node and Ancestor Medium Trees
• 908. Time to Burn Binary Tree from a Node Medium Trees
• 909. Morris Inorder Traversal (O(1) Space) Medium Trees
• 910. Morris Preorder Traversal (O(1) Space) Medium Trees
• 911. Iterative Postorder Using One Stack Medium Trees
• 912. Vertical Order Traversal (Coordinate Sort) Medium Trees
• 913. Check if Two Trees are Isomorphic Medium Trees
• 915. Longest Univalue Path Medium Trees
• 916. House Robber III — Tree DP Medium Trees
• 917. Distribute Coins in Binary Tree Medium Trees
• 933. Pseudo-Palindromic Paths in Binary Tree Medium Trees
• 934. Even Odd Tree Medium Trees
• 935. Check Completeness of a Binary Tree Medium Trees
• 936. Binary Tree Maximum Path Sum (Any to Any) Hard Trees
• 939. Vertical Order Traversal (Full Coordinate Sort) Hard Trees
• 940. Time to Burn Tree — Multi-Source BFS Hard Trees
• 942. Maximum Sum BST in Binary Tree Hard Trees
• 943. Linked List in Binary Tree Hard Trees
• 966. Find Duplicate Subtrees (Hashing) Hard Trees
• 967. Distribute Coins in Binary Tree (Minimum Moves) Hard Trees