[leetcode] 513. Find Bottom Left Tree Value

Given a binary tree, find the leftmost value in the last row of the tree.node Example 1: spa Input: 2 / \ 1 3 Output: 1 Example 2:  code Input: 1 / \ 2 3 /
相關文章
相關標籤/搜索