题目:
原文链接:https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
思路:
- 递归或者使用栈来模拟递归
- 时间复杂度都是O(n)
代码(递归):
import java.util.ArrayList;
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<>();
if(root==null) return result;
inorder(root, result);
return result;
}
public void inorder(TreeNode root, List<Integer> result){
if(root==null){
return;
}
inorder(root.left, result);
result.add(root.val);
inorder(root.right, result);
}
}
代码(栈):
import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<>();
Deque<TreeNode> stack = new LinkedList<>();
while(root!=null || !stack.isEmpty()){
while(root!=null){
stack.push(root);
root = root.left;
}
root = stack.pop();
result.add(root.val);
root = root.right;
}
return result;
}
}