Python: 5 Lines BFS Solution


  • 0
    M
    # Definition for a binary tree node.
    # class TreeNode(object):
    #     def __init__(self, x):
    #         self.val = x
    #         self.left = None
    #         self.right = None
    
    class Solution(object):
        def findBottomLeftValue(self, root):
            """
            :type root: TreeNode
            :rtype: int
            """
            queue = [root]
            while queue:
                prev = queue
                queue = [ kid for node in queue for kid in (node.left,node.right) if kid is not None ]
            return prev[0].val
                
            
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.