MAX DEPTH OF BINARY TREE - Leetcode Problem | Binary Trees | Recursion
In this video, we solve the problem of the Finding Max Depth of a Binary Tree given in Leetcode. This problem is based on Trees and is classified as easy on Leetcode. Learn data structures by solving such problems. Make sure you check out more videos where I teach how you can solve Leetcode problems and improve your data structures and algorithms skills.
If you want to be a Software Engineer at Amazon, Microsoft, Facebook, Google, or any other FAANG company, you need to be prepared to face such problems. These are very common interview questions for these companies. You can write the code in any programming language you want.
Problem Link: https://leetcode.com/problems/maximum...
Code LInk: https://github.com/gargd/Leetcode/blo...
Other videos -
Learn how to calculate Time Complexity - • Struggle with Time Complexity? Watch this.
How I Learned DSA and Got Selected at Amazon - • How I Learnt DSA and Got Into Amazon | My ...
My Roadmap to Learn DSA - • Roadmap To Learn Data Structures and Algor...
Leetcode Valid Parentheses - • VALID PARENTHESES - LeetCode Coding Proble...
Use code THECODESKOOL to get a 10 percent discount on any GeeksForGeeks course.
Subscribe to my channel for more such videos :D
Join my Telegram link for interview preparation material and updates:
https://t.me/thecodeskool
You can also reach me at:
Instagram:
/ thecodeskool
LinkedIn:
/ deevankshu-garg-602501111