LeetCode 94. Binary Tree Inorder Traversal

来源:互联网 发布:现在淘宝卖零食好做吗 编辑:程序博客网 时间:2024/05/02 04:19
/** * 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> inorderTraversal(TreeNode root) {        List<Integer> list = new ArrayList<Integer>();        addToList(root, list);        return list;    }        public static void addToList(TreeNode root, List<Integer> list) {        if (root == null) return;        addToList(root.left, list);        if (root.val != '#') list.add(root.val);        addToList(root.right, list);    }}

0 0
原创粉丝点击