Back to Learning Paths

Tree Problems

شرح LeetCode 572 - Subtree of Another Tree

Watch on YouTube

Subtree of Another Tree Using C++ Time Complexity = O(N × M) because for each of the N nodes in root, we might check all M nodes in subRoot using isSameTree. Worst case happens when many nodes match and we compare the full subtree each time. (it can be reduced to O(N + M)) Try To Do IT ! Space complexity: O(N + M)

Previous

شرح LeetCode 235 - Lowest Common Ancestor in Binary Search Tree

Next Up

شرح LeetCode 100 - Same Tree

More from Tree Problems

شرح LeetCode 98 - Validate Binary Search Tree

شرح LeetCode 98 - Validate Binary Search Tree

Validate Binary Search Tree Using C++ Time Complexity: O(n) Space Complexity: O(...

شرح LeetCode 230 - Kth Smallest Element in a BST

شرح LeetCode 230 - Kth Smallest Element in a BST

Kth Smallest Element in a BST Using C++ Time Complexity: O(n) Space Complexity: ...

شرح LeetCode 1448 - Count Good Nodes in Binary Tree

شرح LeetCode 1448 - Count Good Nodes in Binary Tree

Count Good Nodes in Binary Tree Using C++ Time complexity: O(n) Space complexity...

شرح LeetCode 199 - Binary Tree Right Side View

شرح LeetCode 199 - Binary Tree Right Side View

Binary Tree Right Side View Using C++ Breadth First Search Approach Time Compl...

شرح LeetCode 235 - Lowest Common Ancestor in Binary Search Tree

شرح LeetCode 235 - Lowest Common Ancestor in Binary Search Tree

Lowest Common Ancestor in Binary Search Tree Using C++ -------------------------...

شرح LeetCode 100 - Same Tree

شرح LeetCode 100 - Same Tree

Same Tree Using C++ Time Complexity : O(n) Space Complexity : O(n)

شرح LeetCode 110 - balanced binary tree

شرح LeetCode 110 - balanced binary tree

balanced binary tree Using C++ Brute Force Approach ----------------------------...

شرح LeetCode 543 - Diameter of Binary Tree

شرح LeetCode 543 - Diameter of Binary Tree

Diameter of Binary Tree Using C++ Time complexity: O(n) Space complexity: O(h)

شرح LeetCode 106 - Maximum Depth of Binary Tree

شرح LeetCode 106 - Maximum Depth of Binary Tree

Maximum Depth of Binary Tree Using C++ Time complexity: O(n) Space complexity: O...

شرح ازاي تحل مشاكل الBinary Tree - تطبيق عملي علي مشكلة Invert Binary Tree

شرح ازاي تحل مشاكل الBinary Tree - تطبيق عملي علي مشكلة Invert Binary Tree

Invert Binary Tree Using C++ LeetCode 226. Time Complexity : O(n) Space Complexi...

شرح بالتفصيل LeetCode 94 - Binary Tree Inorder Traversal

شرح بالتفصيل LeetCode 94 - Binary Tree Inorder Traversal

Binary Tree Inorder Traversal Using C++ Recursion Approach: Time Complexity: O(...