力扣每日一题-day1-翻转二叉树

在这里插入图片描述
答案:
Java

class Solution {
    public TreeNode invertTree(TreeNode root) { 
         if (root != null) {
            invertTree(root.left);
            invertTree(root.right);
            TreeNode temp = root.left;
            root.left= root.right;
            root.right = temp;
        }
        return root;
    }
}

补充:前序遍历

public  void preOrder(TreeNode root){
		if(root != null){
			System.out.print(root.value+”->”);
			preOrder(root.left);
			preOrder(root.right)
		}
}

非递归

  public void preOrderTraverse2(TreeNode root) {
        Stack<TreeNode> stack = new Stack<>();
        TreeNode node = root;
        while (node != null || !stack.empty()) {
            if (node != null) {
                System.out.print(node.value + "->");
                stack.push(node);
                node = node.left;
            } else {
                TreeNode tem = stack.pop();
                node = tem.right;
            }
        }
    }

中序遍历

public  void preOrder(TreeNode root){
		if(root != null){
			preOrder(root.left);
			System.out.print(root.value+”->”);
			preOrder(root.right)
		}
}

非递归

  public void preOrderTraverse2(TreeNode root) {
        Stack<TreeNode> stack = new Stack<>();
        TreeNode node = root;
        while (node != null || !stack.empty()) {
            if (node != null) {
                stack.push(node);
                node = node.left;
            } else {
               TreeNode temp = stack.pop();
               System.out.print(temp.value+”->”);
               node = temp.right;
            }
        }
    }

后序遍历

public  void preOrder(TreeNode root){
		if(root != null){
			preOrder(root.left);
			preOrder(root.right)
			System.out.print(root.value+”->”);
		}
}

非递归

 public void preOrderTraverse2(TreeNode root) {
        Stack<TreeNode> stack = new Stack<>();
         TreeNode cur, pre = null;
          stack.push(root);
          
       while (!stack.empty()) {
            cur = stack.peek();
            if ((cur.left == null && cur.right == null) || (pre != null && (pre == cur.left || pre == cur.right))) {
                System.out.print(cur.val + "->");
                stack.pop();
                pre = cur;
            } else {
                if (cur.right != null)
                    stack.push(cur.right);
                if (cur.left != null)
                    stack.push(cur.left);
            }
        }
    }

执行演示

入栈 :4 7 2 3 1                  pre = null, cur = 1
出栈:1  (4 7 2 3)              cur = 1, pre = 1
出栈:3  (4 7 2)                cur = 3,pre = 3
出栈:2  (4 7)                  cur = 2,pre = 2
入栈:9 ,6 (4 7 9 6)           cur = 7,pre = 2
出栈:6  (4 7 9)                cur = 6,pre = 6
出栈:9 (4 7)					 cur = 9 ,pre = 9
出栈:7,4
结束
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值