Commit 97c3385

committed

solves right side view in java

1 parent 121971b commit 97c3385Copy full SHA for 97c3385

File tree

+23

-1

lines changed

+23

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -158,7 +158,7 @@`
`158`	`158`	`\| 190 \| [Reverse Bits](https://leetcode.com/problems/reverse-bits) \| [![Java](assets/java.png)](src/ReverseBits.java) [![Python](assets/python.png)](python/reverse_bits.py) \| \|`
`159`	`159`	`\| 191 \| [Number of One Bits](https://leetcode.com/problems/number-of-1-bits) \| [![Java](assets/java.png)](src/NumberOf1Bit.java) [![Python](assets/python.png)](python/number_of_1_bits.py) \| \|`
`160`	`160`	`\| 198 \| [House Robber](https://leetcode.com/problems/house-robber) \| [![Java](assets/java.png)](src/HouseRobber.java) [![Python](assets/python.png)](python/house_robber.py) \| \|`
`161`		`-\| 199 \| [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) \| \| \|`
	`161`	`+\| 199 \| [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view) \| [![Java](assets/java.png)](src/BinaryTreeRightSideView.java) \| \|`
`162`	`162`	`\| 200 \| [Number of Islands](https://leetcode.com/problems/number-of-islands) \| \| \|`
`163`	`163`	`\| 201 \| [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range) \| \| \|`
`164`	`164`	`\| 202 \| [Happy Number](https://leetcode.com/problems/happy-number) \| [![Java](assets/java.png)](src/HappyNumber.java) [![Python](assets/python.png)](python/happy_number.py) \| \|`

Lines changed: 22 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,22 @@`
	`1`	`+// https://leetcode.com/problems/binary-tree-right-side-view`
	`2`	`+// T: O(n)`
	`3`	`+// S: O(log(n))`
	`4`	`+`
	`5`	`+import java.util.ArrayList;`
	`6`	`+import java.util.List;`
	`7`	`+`
	`8`	`+public class BinaryTreeRightSideView {`
	`9`	`+ public List<Integer> rightSideView(TreeNode root) {`
	`10`	`+ final List<Integer> result = new ArrayList<>();`
	`11`	`+ rightSideView(root, result, 0);`
	`12`	`+ return result;`
	`13`	`+ }`
	`14`	`+`
	`15`	`+ private void rightSideView(TreeNode root, final List<Integer> result, int level) {`
	`16`	`+ if (root == null) return;`
	`17`	`+ if (level == result.size()) result.add(root.val);`
	`18`	`+`
	`19`	`+ rightSideView(root.right, result, level + 1);`
	`20`	`+ rightSideView(root.left, result, level + 1);`
	`21`	`+ }`
	`22`	`+}`

Comments

(0)