1.迭代先序遍历
利用栈实现前序遍历的迭代
- 将root压入(push)栈
- 当栈不为空时进行迭代
(1) cur为出栈元素(出栈的首先是根节点,再是左节点,最后是右节点)
(2)当cur有右子树时先将右子树入栈,再将cur的左子树入栈
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> arr = new ArrayList<>();
if(root == null){
return arr;
}
Deque<TreeNode> sta = new LinkedList<>();
sta.push(root);
while(!sta.isEmpty()