ποΈ All Nodes Distance K in Binary Tree
LeetCode 893 | Difficulty: Medium
ποΈ Average of Levels in Binary Tree
LeetCode 637 | Difficulty: Easy
ποΈ Balanced Binary Tree
LeetCode 110 | Difficulty: Easy
ποΈ Binary Search Tree Iterator
LeetCode 173 | Difficulty: Medium
ποΈ Binary Tree Cameras
LeetCode 1008 | Difficulty: Hard
ποΈ Binary Tree Inorder Traversal
LeetCode 94 | Difficulty: Easy
ποΈ Binary Tree Inorder Traversal
LeetCode 94 | Difficulty: Easy
ποΈ Binary Tree Level Order Traversal
LeetCode 102 | Difficulty: Medium
ποΈ Binary Tree Level Order Traversal II
LeetCode 107 | Difficulty: Medium
ποΈ Binary Tree Longest Consecutive Sequence
LeetCode Link
ποΈ Binary Tree Paths
LeetCode 257 | Difficulty: Easy
ποΈ Binary Tree Postorder Traversal
LeetCode 145 | Difficulty: Easy
ποΈ Binary Tree Preorder Traversal
LeetCode 144 | Difficulty: Easy
ποΈ Binary Tree Right Side View
LeetCode 199 | Difficulty: Medium
ποΈ Binary Tree Tilt
LeetCode 563 | Difficulty: Easy
ποΈ Binary Tree Vertical Order Traversal
LeetCode Link
ποΈ Binary Tree Zigzag Level Order Traversal
LeetCode 103 | Difficulty: Medium
ποΈ Boundary of Binary Tree
LeetCode Link
ποΈ Check Completeness of a Binary Tree
LeetCode 998 | Difficulty: Medium
ποΈ Closest Binary Search Tree Value
LeetCode Link
ποΈ Construct Binary Tree from Inorder and Postorder Traversal
LeetCode 106 | Difficulty: Medium
ποΈ Construct Binary Tree from Preorder and Inorder Traversal
LeetCode 105 | Difficulty: Medium
ποΈ Construct Binary Tree from Preorder and Inorder Traversal
LeetCode 105 | Difficulty: Medium
ποΈ Convert Binary Search Tree to Sorted Doubly Linked List
LeetCode Link
ποΈ Convert Sorted Array to Binary Search Tree
LeetCode 108 | Difficulty: Easy
ποΈ Convert Sorted List to Binary Search Tree
LeetCode 109 | Difficulty: Medium
ποΈ Correct a Binary Tree
LeetCode Link
ποΈ Count Binary Substrings
LeetCode 696 | Difficulty: Easy
ποΈ Count Complete Tree Nodes
LeetCode 222 | Difficulty: Easy
ποΈ Count Good Nodes in Binary Tree
LeetCode 1544 | Difficulty: Medium
ποΈ Count Number of Homogenous Substrings
LeetCode 1885 | Difficulty: Medium
ποΈ Count Univalue Subtrees
LeetCode Link
ποΈ Cousins in Binary Tree
LeetCode 1035 | Difficulty: Easy
ποΈ Delete Node in a BST
LeetCode 450 | Difficulty: Medium
ποΈ Diameter of Binary Tree
LeetCode 543 | Difficulty: Easy
ποΈ Distribute Coins in Binary Tree
LeetCode 1021 | Difficulty: Medium
ποΈ Find Bottom Left Tree Value
LeetCode 513 | Difficulty: Medium
ποΈ Find Largest Value in Each Tree Row
LeetCode 515 | Difficulty: Medium
ποΈ Find Leaves of Binary Tree
LeetCode Link
ποΈ Flatten Binary Tree to Linked List
LeetCode 114 | Difficulty: Medium
ποΈ Graph Valid Tree
LeetCode Link
ποΈ Implement Trie (Prefix Tree)
LeetCode 208 | Difficulty: Medium
ποΈ Inorder Successor in BST
LeetCode Link
ποΈ Insert into a Binary Search Tree
LeetCode 784 | Difficulty: Medium
ποΈ Invert Binary Tree
LeetCode 226 | Difficulty: Easy
ποΈ Kth Smallest Element in a BST
LeetCode 230 | Difficulty: Medium
ποΈ Longest Palindromic Substring
LeetCode 5 | Difficulty: Medium
ποΈ Longest Substring with At Least K Repeating Characters
LeetCode 395 | Difficulty: Medium
ποΈ Longest Substring with At Most K Distinct Characters
LeetCode Link
ποΈ Longest Substring with At Most Two Distinct Characters
LeetCode Link
ποΈ Longest Substring Without Repeating Characters
LeetCode 3 | Difficulty: Medium
ποΈ Lowest Common Ancestor of a Binary Search Tree
LeetCode 235 | Difficulty: Medium
ποΈ Lowest Common Ancestor of a Binary Tree
LeetCode 236 | Difficulty: Medium
ποΈ Maximum Depth of Binary Tree
LeetCode 104 | Difficulty: Easy
ποΈ Maximum Depth of N-ary Tree
LeetCode 774 | Difficulty: Easy
ποΈ Merge Two Binary Trees
LeetCode 617 | Difficulty: Easy
ποΈ Minimum Absolute Difference in BST
LeetCode 530 | Difficulty: Easy
ποΈ Minimum Depth of Binary Tree
LeetCode 111 | Difficulty: Easy
ποΈ Minimum Distance Between BST Nodes
LeetCode 799 | Difficulty: Easy
ποΈ Minimum Number of Swaps to Make the String Balanced
LeetCode 2095 | Difficulty: Medium
ποΈ Minimum Path Sum
LeetCode 64 | Difficulty: Medium
ποΈ Minimum Window Substring
LeetCode 76 | Difficulty: Hard
ποΈ Modification
Populate Next Right Pointers in Each Node
ποΈ N-ary Tree Level Order Traversal
LeetCode 764 | Difficulty: Medium
ποΈ N-ary Tree Postorder Traversal
LeetCode 776 | Difficulty: Easy
ποΈ N-ary Tree Preorder Traversal
LeetCode 775 | Difficulty: Easy
ποΈ Next Palindrome Using Same Digits
LeetCode Link
ποΈ Number of Substrings Containing All Three Characters
LeetCode 1460 | Difficulty: Medium
ποΈ Number of Substrings With Only 1s
LeetCode 1636 | Difficulty: Medium
ποΈ Palindromic Substrings
LeetCode 647 | Difficulty: Medium
ποΈ Path Sum
LeetCode 112 | Difficulty: Easy
ποΈ Path Sum II
LeetCode 113 | Difficulty: Medium
ποΈ Range Sum of BST
LeetCode 975 | Difficulty: Easy
ποΈ Recover the Original Array
LeetCode 2241 | Difficulty: Hard
ποΈ Repeated Substring Pattern
LeetCode 459 | Difficulty: Easy
ποΈ Same Tree
LeetCode 100 | Difficulty: Easy
ποΈ Same Tree
LeetCode 100 | Difficulty: Easy
ποΈ Search in a Binary Search Tree
LeetCode 783 | Difficulty: Easy
ποΈ Second Minimum Node In a Binary Tree
LeetCode 671 | Difficulty: Easy
ποΈ Serialize and Deserialize Binary Tree
LeetCode 297 | Difficulty: Hard
ποΈ Serialize and Deserialize BST
LeetCode 449 | Difficulty: Medium
ποΈ Serialize and Deserialize N-ary Tree
LeetCode Link
ποΈ Split BST
LeetCode Link
ποΈ Substring with Concatenation of All Words
LeetCode 30 | Difficulty: Hard
ποΈ Substrings That Begin and End With the Same Letter
LeetCode Link
ποΈ Subtree of Another Tree
LeetCode 572 | Difficulty: Easy
ποΈ Sum of Distances in Tree
LeetCode 863 | Difficulty: Hard
ποΈ Sum Root to Leaf Numbers
LeetCode 129 | Difficulty: Medium
ποΈ Symmetric Tree
LeetCode 101 | Difficulty: Easy
ποΈ Two Sum BSTs
LeetCode Link
ποΈ Unique Binary Search Trees
LeetCode 96 | Difficulty: Medium
ποΈ Unique Binary Search Trees II
LeetCode 95 | Difficulty: Medium
ποΈ Univalued Binary Tree
LeetCode 1005 | Difficulty: Easy
ποΈ Validate Binary Search Tree
LeetCode 98 | Difficulty: Medium
ποΈ Verify Preorder Sequence in Binary Search Tree
LeetCode Link
ποΈ Vertical Order Traversal of a Binary Tree
LeetCode 1029 | Difficulty: Hard
ποΈ Zigzag Conversion
LeetCode 6 | Difficulty: Medium