Solving the '199. Binary Tree Right Side View' Problem in Java LeetCode 75 Study Plan

preview_player
Показать описание
In today's video walkthrough, we're diving into a fascinating binary tree problem from the LeetCode 75 Study Plan: 'Binary Tree Right Side View'. Imagine standing to the right side of a binary tree and noting down the nodes you can see, level by level. Our goal is to determine this right-side view. We'll explore a BFS-based approach, which ensures we capture the rightmost visible node at each tree level. Stick around to understand the ins and outs of the solution, and don't forget to check out the rest of the series for comprehensive coverage of key problems!

BFS Resources:

Рекомендации по теме
Комментарии
Автор

Just curious why did you choose Java over Python for leetcode? Just personal preference? Alot of ppl reccomend python because of the simpler syntax, but i like java more tbh

the-bald-cn
Автор

Hey Christian, I start WGU for software engineering on the 1st of next month and I have basically 0 programming knowledge. Do you have any quick advice or things you think I should learn or do before I start? Thanks

Traternal
welcome to shbcf.ru