题目:
给定一个二叉树的根节点 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]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/binary-tree-inorder-traversal
var inorderTraversal = function(root) {
// dfs
let stack = [];
let ans = [];
while(root||stack.length){
// 走到底
while(root){
stack.push(root);
root = root.left;
}
root = stack.pop();
ans.push(root.val);
// 向右找
root = root.right;
}
return ans;
};