aboutsummaryrefslogtreecommitdiff
path: root/find_bottom_left_tree.py
blob: d1a2444aec4844245da01a8328b2bc07cb62de93 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
# 513. Find Bottom Left Tree Value

"""
given the 'root' of a binary tree, return the leftmost value in the last row
of the tree
"""


class TreeNode(object):
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right


class Solution(object):
    def findBottomLeftValue(self, root):
        queue = [root]
        for node in queue:
            queue += filter(None, (node.right, node.left))
        return node.val