leetcode:Binary Tree Inorder Traversal

来源:互联网 发布:js 对象属性名是变量 编辑:程序博客网 时间:2024/06/15 19:28

二叉树的中序遍历


/** * Definition for binary tree * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode(int x) { val = x; } * } */public class Solution {    static ArrayList<Integer> ans ;     public ArrayList<Integer> inorderTraversal(TreeNode root) {        ans = new ArrayList<>();        travel(root);        return ans;    }        void travel(TreeNode node){        if(node != null ){            travel(node.left);            ans.add(node.val);            travel(node.right);        }    }}


0 0