FilesExpand file tree

 master

/

199_BinaryTreeRightSideView199.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

44 lines (39 loc) · 1.03 KB

 master

/

199_BinaryTreeRightSideView199.java

Copy path

Top

File metadata and controls

• Code
• Blame

44 lines (39 loc) · 1.03 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

/**

* 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.

*

* Example:

*

* Input: [1,2,3,null,5,null,4]

* Output: [1, 3, 4]

*

* Explanation:

*

* 1 <---

* / \

* 2 3 <---

* \ \

* 5 4 <---

*/

/**

* Definition for a binary tree node.

* public class TreeNode {

* int val;

* TreeNode left;

* TreeNode right;

* TreeNode(int x) { val = x; }

* }

*/

public class BinaryTreeRightSideView199 {

public List<Integer> rightSideView(TreeNode root) {

List<Integer> res = new ArrayList<>();

rightSideView(root, res, 0);

return res;

}

public void rightSideView(TreeNode root, List<Integer> res, int level) {

if (root == null) return;

if (level >= res.size()) res.add(root.val);

if (root.right != null) rightSideView(root.right, res, level+1);

if (root.left != null) rightSideView(root.left, res, level+1);

}

}