GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Algorithm/java/coding/treeImage.java at master · lelea2/Algorithm Expand file tree/ Copy pathtreeImage.javaMore file actions 46 lines (36 loc) · 1.02 KB / Copy pathtreeImage.javaFile metadata and controls46 lines (36 loc) · 1.02 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 /** * Create Mirror image of a binary tree */ //Recursive solution public static TreeNode mirrorBinaryTree(TreeNode root) { if(root == null || (root.left == null && root.right == null)) return root; TreeNode temp = root.left; root.left = root.right; root.right = temp; mirrorBinaryTree(root.left); mirrorBinaryTree(root.right); return root; } //Interative solution public static TreeNode mirrorBinaryTreeIterative(TreeNode root){ if(root == null || (root.left == null && root.right == null)) { return root; } TreeNode parent = root; Stack<TreeNode> treeStack = new Stack<TreeNode>(); treeStack.push(root); while(!treeStack.empty()) { parent = treeStack.pop(); TreeNode temp = parent.right; parent.right = parent.left; parent.left = temp; if(parent.right != null) { treeStack.push(parent.right); } if(parent.left != null) { treeStack.push(parent.left); } } return root; } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |