题目描述:
给定一个二叉树,返回它的中序 遍历。
输入:
[1,null,2,3]
输出:
[1,3,2]
题意:
题目描述
题解:
按照中序遍历的定义,直接去模拟
代码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> ans = new ArrayList<>();
if(root == null) return ans;
Stack<TreeNode> st = new Stack<>();
while(!st.isEmpty() || root != null) {
if(root != null) {
st.push(root);
root = root.left;
}
else {
root = st.pop();
ans.add(root.val);
root = root.right;
}
}
return ans;
}
}