20. Lowest Common Ancestor of a Binary Tree (LeetCode) | DFS Pattern | Binary Tree Tutorials | Code

Показать описание

#tree #datastructures #interview

Hello viewers!

In this video, we have discussed the 6th problem on DFS i.e Lowest Common Ancestor of a Binary Tree LeetCode.
----------------------------------------------------
----------------------------------------------------
----------------------------------------------------
----------------------------------------------------
----------------------------------------------------

Please consider subscribing to the channel.

Extra video covers:

Tree Data Structures
Binary Tree Data Structures
Video Series on Tree
Best Tree Videos
Beginner to Advanced
Binary Tree Tutorials
Tree Tutorials

Рекомендации по теме

Комментарии

At 7:50 (mm:ss) -
For storing paths, assuming that the binary tree is not skewed, the space required is O(log N). Otherwise, O(N) space is required in the case of the Skew Tree.

aakashverma

The way you are explaining the problem theory and it's solution is so cool . So please continue this process.

Entertainment-lzei

To be honest, sir you have made DFS look so easy.👏👏
Simply a masterpiece🔥🔥👌👌

surabhsaxena

# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None

class Solution:
def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
return self.lca(root, p, q)

def lca(self, root, p, q):
if root ==None:
return None
elif root == p or root==q:
return root
else:
left = self.lca(root.left, p, q)
right = self.lca(root.right, p, q)

if left==None and right==None:
return None
elif left!=None and right!=None:
return root
elif left==None:
return right
elif right==None:
return left

dsaaz

Is this playlist covers all topic asked from trees in interview??

amansrivastava

Best explanation lekin kaashi itna deemag coding round mein chalta

RishabhMishra-uwyb

20. Lowest Common Ancestor of a Binary Tree (LeetCode) | DFS Pattern | Binary Tree Tutorials | Code

Lowest Common Ancestor of Deepest Leaves - Leetcode 1123 - Python

20. Lowest Common Ancestor of a Binary Tree (LeetCode) | DFS Pattern | Binary Tree Tutorials | Code

Leetcode - Lowest Common Ancestor of a Binary Tree (Python)

Lowest Common Ancestor of a Binary Search Tree - LeetCode 236 - Coding Interview

Recent Facebook Coding Interview Question: Lowest Common Ancestor of Binary Tree with Parent Pointer

LOWEST COMMON ANCESTOR OF DEEPEST LEAVES | LEETCODE 1123 | PYTHON DFS SOLUTION

Lowest Common Ancestor of a Binary Search Tree

Leetcode 865/1123 Lowest Common Ancestor of Deepest Leaves

1123. Lowest Common Ancestor of Deepest Leaves | Using BFS & Storing Parents | Easy Explanation

Lowest Common Ancestor in a Binary Tree

236. Lowest Common Ancestor of a Binary Tree | LeetCode Medium | Python Solution | Binary Tree | DFS

Lowest Common Ancestor of a Binary Search Tree - LeetCode 235 - Python

BST - 16: Find Lowest Common Ancestor (LCA) for given values in Binary Search Tree

Lowest Common Ancestor (LCA) in Binary Search Tree | Recursive + Iterative

Lowest Common Ancestor (LCA) in a Binary Tree | Trees

Lowest Common Ancestor of a Binary Tree Leet Code Question Explained using Recursion

LeetCode 235. Lowest Common Ancestor of a Binary Search Tree - Interview Prep Ep 137

Lowest Common Ancestor (LCA) Problem | Source Code

L27. Lowest Common Ancestor in Binary Tree | LCA | C++ | Java

Lowest Common Ancestor of BST!

🔍 Find the Lowest Common Ancestor (LCA) in a Binary Tree using DFS! 🌲💡 #Python #DSA #Recursion...

Day 5 - Lowest Common Ancestor in a Binary Tree | 21 Days DSA Challenge by @Shumbul

Lowest Common Ancestor of a Binary Search Tree | Leetcode 235 | Live coding session

Lowest Common Ancestor of a Binary Tree | LEETCODE 236 | Interview Problems