声明:原题目转载自LeetCode,解答部分为原创
Problem :
Given a binary tree, find the leftmost value in the last row of the tree.
Example 1:
声明:原题目转载自LeetCode,解答部分为原创
Problem :
Given a binary tree, find the leftmost value in the last row of the tree.
Example 1: