Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**
- * Definition for a binary tree node.
- * public class TreeNode {
- * int val;
- * TreeNode left;
- * TreeNode right;
- * TreeNode(int x) { val = x; }
- * }
- */
- class Solution {
- public List<Integer> inorderTraversal(TreeNode root) {
- List<Integer> res = new ArrayList<>();
- helper(root, res);
- return res;
- }
- private void helper(TreeNode node, List<Integer> res) {
- if (node == null) {
- return;
- }
- helper(node.left, res);
- res.add(node.val);
- helper(node.right, res);
- }
- }
Add Comment
Please, Sign In to add comment