前中后序遍历的非递归版本
前序遍历核心块
while(root != null || !stack.isEmpty()){
//go left down to the ground
while(root != null){
res.add(root.val);
stack.push(root);
root = root.left;
}
//if we reach to the leaf, go back to the parent right, and re.
转载
2021-04-06 20:11:24 ·
42 阅读 ·
0 评论