首页 > 代码库 > LeetCode-Binary Tree Right Side View
LeetCode-Binary Tree Right Side View
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
For example:
Given the following binary tree,
1 <--- / 2 3 <--- \ 5 4 <---
You should return [1, 3, 4].
Credits:
Special thanks to @amrsaqr for adding this problem and creating all test cases.
Solution:
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public List<Integer> rightSideView(TreeNode root) { List<Integer> resList = new LinkedList<Integer>(); rightSideViewRecur(root,resList,1); return resList; } public void rightSideViewRecur(TreeNode curNode, List<Integer> resList, int depth){ if (curNode==null){ return; } if (resList.size()<depth){ resList.add(curNode.val); } rightSideViewRecur(curNode.right,resList,depth+1); rightSideViewRecur(curNode.left,resList,depth+1); }}
LeetCode-Binary Tree Right Side View
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。