Binary Tree - 54: Get deepest Left Leaf Node in Binary Tree

Source Code:https://thecodingsimplified.com/get-deepest-left-leaf-node-in-binary-tree/ Solution: - We'll take variable deepestLeftLeafNode & currentLevel - We'll traverse Binary Tree in Pre Order manner & when we're moving left, we'll pass true & when we're moving right, we'll pass false in a variable. - Whenever we find Leaf node, we'll check if it's left leaf & if level is greater than current level. - Time Complexity: O(n) - Space Complexity: O(1) Do Watch video for more info This Problem is synonym of following problems: binary tree Get deepest Left Leaf Node in Binary Tree, Get deepest Left Leaf Node in Binary Tree in binary tree, coding simplified CHECK OUT CODING SIMPLIFIED https://www.youtube.com/codingsimplified ★☆★ VIEW THE BLOG POST: ★☆★ http://thecodingsimplified.com I started my YouTube channel, Coding Simplified, during Dec of 2015. Since then, I've published over 200+ videos. ★☆★ SUBSCRIBE TO ME ON YOUTUBE: ★☆★ https://www.youtube.com/codingsimplified?sub_confirmation=1 ★☆★ Send us mail at: ★☆★ Email: [email protected]