递归与非递归的算法效率

背景：

题目描述

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

输入描述:

二叉树的镜像定义：源二叉树 
    	    8
    	   /  \
    	  6   10
    	 / \  / \
    	5  7 9 11
    	镜像二叉树
    	    8
    	   /  \
    	  10   6
    	 / \  / \
    	11 9 7  5

代码1：递归

/**
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    public void Mirror(TreeNode root) {
        if(root!=null){
            TreeNode left = root.left;
            root.left = root.right;
            root.right = left;
            
            Mirror(root.left);
            Mirror(root.right);
        }
    }
}

代码2：非递归

/**
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) {
        List
   
   
    
     listNode = new ArrayList
    
    
     
     ();
        if(root!=null){
            listNode.add(root);
            TreeNode p1,p2;
            while(listNode.size() > 0){
                p1 = listNode.remove(0);
                if(p1.left!=null){
                    listNode.add(p1.left);
                }
                if(p1.right!=null){
                    listNode.add(p1.right);
                }
                p2=p1.right;
                p1.right=p1.left;
                p1.left = p2;
                 
            }
        }
    }
}
    
    
   
   

结果：