给定一个二叉树的根节点 root
,返回它的 中序 遍历。
示例 1:
输入:root = [1,null,2,3] 输出:[1,3,2]
示例 2:
输入:root = [] 输出:[]
示例 3:
输入:root = [1] 输出:[1]
示例 4:
输入:root = [1,2] 输出:[2,1]
示例 5:
输入:root = [1,null,2] 输出:[1,2]
提示:
- 树中节点数目在范围
[0, 100]
内 -100 <= Node.val <= 100
进阶: 递归算法很简单,你可以通过迭代算法完成吗?
package Solution94;
import java.util.ArrayList;
import java.util.List;
class Solution {
List<Integer> out = new ArrayList<Integer>();
public List<Integer> inorderTraversal(TreeNode root) {
if (root != null) {
inorderTraversal(root.left);
out.add(root.val);
inorderTraversal(root.right);
}
return out;
}
public boolean isSameTree(TreeNode p, TreeNode q) {
if (p == null && q == null) {
return true;
}
if ((p == null || q == null) || p.val != q.val) {
return false;
}
if (!isSameTree(p.left, q.left)) {
return false;
}
if (!isSameTree(p.right, q.right)) {
return false;
}
return true;
}
public static void main(String[] args) {
Solution sol = new Solution();
TreeNode first = new TreeNode(3);
first.left = new TreeNode(6);
first.right = new TreeNode(9);
TreeNode second = new TreeNode(3);
second.left = new TreeNode(9);
second.right = new TreeNode(6);
System.out.println(sol.inorderTraversal(first));
}
}