public class Solution
{
public List<Integer> rightSideView(TreeNode root)
{
List<Integer> res = new ArrayList<>();
rightSideViewNew(root, res, 0);
return res;
}
public void rightSideViewNew(TreeNode root, List<Integer> res, int depth)
{
if(root == null) return;
if(depth == res.size()) res.add(root.val);
rightSideViewNew(root.right, res, depth+1);
rightSideViewNew(root.left, res, depth+1);
}
}
从右边看二叉树组成的序列
最新推荐文章于 2020-08-23 21:37:25 发布