LeetCode 94. 数据结构->二叉树的中序遍历
原题链接
简单
作者:
JustDoIt11
,
2023-10-31 12:40:38
,
所有人可见
,
阅读 32
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
List<Integer> ans = new ArrayList<>();
public List<Integer> inorderTraversal(TreeNode root) {
tranverse(root);
return ans;
}
public void tranverse(TreeNode root){
if (root == null) return ;
tranverse(root.left);
ans.add(root.val);
tranverse(root.right);
}
}