Great explanation as always. Even though I am able to solve some of this problems by myself, and even though I don't know Python, I still find something to learn in each of this videos. Thank you!
What if a subtree has two leaves which are unsymmetrically deepest? eg they are the deepest and the 2nd deepest leaves, and their depth differs by 1 and no other leaf is nearly as deep as these two?
