GOOGLE - BINARY TREE LEVEL ORDER TRAVERSAL (LeetCode)

This is one of Google's favorite interview questions to ask! Binary Tree Level Order Traversal LeetCode coding solution. Coding Interviews Binary Tree Level Order Traversal (LeetCode) question and explanation.
My Desk Setup
Desk - https://bit.ly/3jfY195
Chair - https://amzn.to/2O9TM3r
Monitor - https://amzn.to/3rcSHGa
Webcam - https://amzn.to/2NUmwgi
Desktop - https://amzn.to/3tiySPL
Laptops - https://amzn.to/3aRoN3Z
iPad - https://amzn.to/2LlJzzJ
Keyboard - https://amzn.to/3jfbxdd
Mouse - https://amzn.to/36ElWtT
Wrist Rest - https://amzn.to/3trrHF4 (pls don't buy this)
Mouse Pad - https://amzn.to/2Myz2lt
Microphone - https://amzn.to/3atNyTA
Lamp - https://amzn.to/3jjfZYp
Headphones - https://amzn.to/3tvr0KU (new model)
Headphone Hook - https://amzn.to/3tr8uTC
Blue Light Glasses - https://amzn.to/3cDVUdK
Wireless Charger - https://amzn.to/39LY1uu
Keyboard cable - https://amzn.to/2O5p2R5
Mic arm - https://amzn.to/3cECZj8
Audio interface - https://amzn.to/36HdWIi
Cloudlifter - https://amzn.to/36VO6kf
Laptop dock - https://amzn.to/2O2DsBw
Motherboard - https://amzn.to/3rkiWuA
Solid state - https://amzn.to/3rk5vuo
CPU cooler - https://amzn.to/3tnwwPA
CableMod - https://amzn.to/3tqbtM8
CPU - https://amzn.to/3auG1ns
Power supply - https://amzn.to/3trsAxo
RAM - https://amzn.to/39JZcuf
Designing Data-Intensive Applications - https://amzn.to/2YK4ek1
Clean Code - https://amzn.to/3txqfB5
Meditations - https://amzn.to/3cDa4fi

DISCORD CHANNEL
----------------------------------------------------------------------------------------------------------------
To join the Discord channel use the following link and join the "Member" tier: https://www.patreon.com/KevinNaughtonJr
In this Discord channel, you will be able to...
1. Ask me questions directly (as well as other members)
2. Ask about and discuss previous interview experiences
3. Find mock interview partners
4. Share helpful videos for interview preparation, and more!

This question is commonly asked by the following companies: Google, Facebook, Amazon, Uber, Microsoft, Oracle, Bloomberg, LinkedIn, and Walmart Labs.

Link to problem: https://leetcode.com/problems/binary-tree-level-order-traversal/

Intuition behind solution: Create a queue and add the root to the queue. While the queue is not empty process all the nodes in the queue. At every iteration of the queue not being empty, get the size of the queue (this represents however many nodes are on the current level of the tree). Iterate through all these nodes with a for loop, adding their values to a "current level" list. After adding their value to the list, check if they have left and right children adding them to the queue is they do exist (this allows us to process the next level of the tree on the next iteration of our while loop). Once our for loop terminates we have populated a list of all the nodes' values on the current level and we add this list to our return value (a list of lists). Once our while loop ends we have processed all the levels of the true and therefore return our result (our list of lists).

SOCIAL
----------------------------------------------------------------------------------------------------------------
Support me on Patreon: https://www.patreon.com/KevinNaughtonJr
Follow me on Twitter: https://twitter.com/KevinNaughtonJr
Follow me on Instagram: https://www.instagram.com/KevinNaught...
Follow me on GitHub: https://github.com/kdn251

MUSIC
----------------------------------------------------------------------------------------------------------------
Blushes by Dj Quads
https://soundcloud.com/aka-dj-quads/blushes
rose & boujee by memori ("me over mori")
https://soundcloud.com/beatsbymemori/rose-and-boujee

#coding #interviews #softwareengineering

Видео GOOGLE - BINARY TREE LEVEL ORDER TRAVERSAL (LeetCode) канала Kevin Naughton Jr.