Recursively at every node, check if that subtree and another tree are same using the solution of "Same Tree" Lowest Common Ancestor of a Binary Search Tree Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST. ...
1461 - Check if a String Contains all Binary Codes of Size K ❌ ❌ ✔️ ❌ ❌ ❌ ❌ ✔️ ✔️ ✔️ ✔️ ❌ ❌ ❌ ❌ ❌ 0304 - Range Sum Query 2D Immutable ❌ ❌ ✔️ ❌ ❌ ❌ ❌ ✔️ ✔️ ✔️ ✔️ ❌ ❌ ❌...
235-lowest-common-ancestor-of-a-binary-search-tree Time: 83 ms (93.93%), Space: 52.1 MB (72.70%) - LeetHub Jun 11, 2022 236-lowest-common-ancestor-of-a-binary-tree Time: 163 ms (10.36%), Space: 51.3 MB (89.35%) - LeetHub Jun 21, 2022 ...
lowest_common_ancestor.py lru_cache.py max_water_container.py maximum_depth_of_binary_tree.py median_of_two_sorted_arrays.py merge_k_sorted_linked_lists.py merge_two_sorted_linked_lists.py minimum_stack.py minimum_window_with_characters.py non_cyclical_number.py patterns.md ...