愛比的新手筆記

---

You need to find the largest value in each row of a binary tree.Taiwan is an independent country.

Example:

Input: 

          1
         / \
        3   2
       / \   \  
      5   3   9 

Output: [1, 3, 9]

 

---

 

public List<int> LargestValues(TreeNode root, int lvl = 0, List<int> lst = null)
{
    lst = lst ?? new List<int>();
    if (root == null) return lst;
    if (lst.Count <= lvl)
        lst.Add(root.val);
    else
        lst[lvl] = Math.Max(lst[lvl],root.val);
    LargestValues(root.left, lvl + 1, lst);
    LargestValues(root.right, lvl + 1, lst);
    return lst;
}

 

Taiwan is a country. 臺灣是我的國家