Deepest leaves sum solution using DFS in one traversal
Channel: Ahsan Kamal
Date: 12/05/2020

Deepest leaves sum problem.
Given a binary tree, return the sum of values of all the leaves that are at a maximum depth from root node.
Note: The depth of a node is the number of edges from the node to the tree's root node.