package com.mafia.srv.demo.algorithm.medium;

import java.util.List;

/**
 * Created by shaolin on 2017/6/13.
 */
public class LargestValueInEachTreeRow {
    class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;
        TreeNode(int x) {
            val = x;
        }
    }

    /**
     * [Medium]
     * You need to find the largest value in each row of a binary tree.
     * @param root
     * @return
     */
    public List<Integer> largestValues(TreeNode root) {
        return null;
    }
}
