Leetcode | 1261. Find Elements in a Contaminated Binary Tree | Medium | Java

preview_player
Показать описание
This video has the Problem Statement, Solution Walk-through, Code and Dry Run for the Leetcode Question 1261. Find Elements in a Contaminated Binary Tree, with Time Complexity of O(n) and Space Complexity of O(n).

Please refer these similar Binary tree questions solved using BFS, where I explained it using an example with dry run:

Time Stamps ⏱️:
0:00 - Problem Statement
1:09 - Solution Walk-through
2:27 - Coding [Java]
6:13 - Time and Space Complexity
____
1261. Find Elements in a Contaminated Binary Tree
Leetcode Find Elements in a Contaminated Binary Tree
Find Elements in a Contaminated Binary Tree
Find Elements in a Contaminated Binary Tree Leetcode Solution
Find Elements in a Contaminated Binary Tree Java Solution
Leetcode 1261
Leetcode 1261 solution
Leetcode Solutions Playlist
Leetcode Java Solutions Playlist
Leetcode Medium Solutions
Leetcode Medium Java Solutions
Leetcode Medium Java Solutions Playlist
Developer Docs Leetcode
Find Elements in a Contaminated Binary Tree Developer Docs

Hashtags:
#leetcode #leetcodesolution #java #leetcodedailychallenge
Рекомендации по теме
Комментарии
Автор

To learn about BFS and queue dry-run, please refer these videos where I explained it using an example with dry run:

developer-docs
join shbcf.ru