leetcode94:二叉树的中序遍历

二叉树的中序遍历

给定一个二叉树的根节点 root ，返回 它的 中序 遍历 。

List<Integer> list = new ArrayList<>();public List<Integer> inorderTraversal(TreeNode root) {getNode(root);return list;}void getNode(TreeNode node){list.add(node.val);if (node.left != null) {getNode(node.left);}if (node.right != null) {getNode(node.right);}}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;}}