二叉树的镜像java实现

来源:互联网 发布:男士毛孔粗大 知乎 编辑:程序博客网 时间:2024/05/13 14:20

操作给定的二叉树,将其变换为源二叉树的镜像。

/**public class TreeNode {    int val = 0;    TreeNode left = null;    TreeNode right = null;    public TreeNode(int val) {        this.val = val;    }}*/import java.util.*;public class Solution {    public void Mirror(TreeNode root) {         if(root == null) return;        Stack<TreeNode> stack = new Stack<TreeNode>();        stack.push(root);        while(!stack.empty()) {            TreeNode node = stack.pop();            if(node.left != null || node.right != null) {                TreeNode nodeLeft = node.left;                TreeNode nodeRight = node.right;                node.left = nodeRight;                node.right = nodeLeft;            }            if(node.left != null) stack.push(node.left);            if(node.right != null) stack.push(node.right);        }    }}
原创粉丝点击