AC:Java 0ms solution


  • 0
    Z
    public class Solution {
        public TreeNode invertTree(TreeNode root) {
            if(root == null){
    			return null;
    		}else{
    			TreeNode temp=root.left;
    			root.left=root.right;
    			root.right=temp;
    		}
    		invertTree(root.left);
    		invertTree(root.right);
    		return root;
        }
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.