LOWEST COMMON ANCESTOR OF DEEPEST LEAVES | LEETCODE 1123 | PYTHON DFS SOLUTION
Автор: Cracking FAANG
Загружено: 2023-01-05
Просмотров: 3645
Описание:
Discord: / discord
Problem Link: https://leetcode.com/problems/lowest-...
In this video we are solving yet again another DFS based tree question: Lowest Common Ancestor of Deepest Leaves (Leetcode 1123).
This question is a mash up of finding the deepest leaves in a binary tree and also finding the LCA of a node. It really isn't that complicated and can be solved using the familiar DFS template we use for a lot of these DFS tree questions.
TIMESTAMPS:
00:00 Intro
00:20 Question Prompt
00:55 Example & Intuition
02:53 Coding
9:22 Time/Space Complexity
10:40 Outro
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке: