06/30/2019

Author: anubhav1006

src/DSA/Trees/MorrisTraversal.java

@@ -36,6 +36,31 @@ static void MorrisTraverseInorder(node root){
  }
 
  }
+ static void MorrisTraversePostOrder(node root){
+ if(root==null)
+ return;
+ while(root!=null) {
+ if (root.right == null) {
+ System.out.print(root.key + " ");
+ root = root.left;
+ } else {
+ node right = root.right;
+ while (right.right != null && right.right != root)
+ right = right.left;
+ if (right.left == null) {
+ right.left = root;
+ root = root.right;
+ }else {
+ right.left = null;
+ System.out.print(root.key+" ");
+ root = root.left;
+ }
+
+ }
+ }
+
+ }
+
 
  static void MorrisTraversePreorder(node root){
  if(root==null)
@@ -70,6 +95,6 @@ public static void main(String[] args) {
  root.left.left = new node(4);
  root.left.right = new node(5);
 
- MorrisTraversePreorder(root);
+ MorrisTraversePostOrder(root);
  }
 }

src/DSA/Trees/PathNode.java

@@ -0,0 +1,54 @@
+package DSA.Trees;
+
+import java.util.ArrayList;
+import java.util.Stack;
+
+public class PathNode {
+ static class node {
+ int key;
+ node left, right;
+
+ public node(int key) {
+ this.key = key;
+ left = right = null;
+ }
+ }
+
+ static boolean hasPath(node root, int data, ArrayList<Integer> arr) {
+ if (root == null) {
+ return false;
+ }
+ arr.add(root.key);
+ if (root.key == data) {
+ return true;
+ }
+ if(hasPath(root.left, data, arr) || hasPath(root.right, data, arr))
+ return true;
+
+ arr.remove(arr.size()-1);
+ return false;
+ }
+
+ public static void main(String[] args) {
+ node root=new node(1);
+ root.left = new node(2);
+ root.right = new node(3);
+ root.left.left = new node(4);
+ root.left.right = new node(5);
+ root.right.left = new node(6);
+ root.right.right = new node(7);
+ int x=5;
+ PrintPath(root, 6);
+ }
+
+ private static void PrintPath(node root, int x) {
+ ArrayList<Integer> arr = new ArrayList<>();
+
+ if(hasPath(root, x,arr)){
+
+ for(int i: arr){
+ System.out.print(i+" ");
+ }
+ }
+ }
+}

src/DSA/Trees/PrintOddNodes.java

@@ -0,0 +1,54 @@
+package DSA.Trees;
+
+public class PrintOddNodes {
+ static class node {
+ int key;
+ node left, right;
+
+ public node(int key) {
+ this.key = key;
+ left = right = null;
+ }
+ }
+
+ static void printOddnodes(node root) {
+ int h = height(root);
+ for (int i = 1; i <= h; i += 2) {
+ printOddnodesUtil(root, i);
+ }
+ }
+
+ private static void printOddnodesUtil(node root, int i) {
+ if (i == 1) {
+ System.out.print(root.key + " ");
+ }
+ if(root.left!=null)
+ printOddnodesUtil(root.left, i - 1);
+ if(root.right!=null)
+ printOddnodesUtil(root.right, i - 1);
+
+ }
+
+ static int height(node root) {
+ if (root == null)
+ return 0;
+
+ return 1 + Math.max(height(root.left), height(root.right));
+ }
+
+ public static void main(String[] args) {
+ node root = new node(1);
+ root.left = new node(2);
+ root.right = new node(3);
+ root.left.left = new node(4);
+ root.left.right = new node(5);
+ root.right.right = new node(6);
+ root.left.right.left = new node(7);
+ root.left.right.right = new node(8);
+ root.right.right.left = new node(9);
+ printOddnodes(root);
+
+
+ }
+
+}

src/DSA/Trees/TreeAndMirror.java

@@ -0,0 +1,49 @@
+package DSA.Trees;
+
+public class TreeAndMirror {
+ static class node{
+ int key;
+ node left, right;
+
+ public node(int key) {
+ this.key = key;
+ left = right = null;
+ }
+ }
+
+ static class BinaryTree{
+ node a, b;
+
+ boolean areMirror(node a, node b){
+ if(a==null&&b==null)
+ return true;
+ else if((a==null && b!=null) || (a!=null&&b==null)){
+ return false;
+ }
+
+ if(a.key!=b.key)
+ return false;
+ return areMirror(a.left, b.right) && areMirror(a.right,b.left);
+ }
+ }
+
+ public static void main(String[] args) {
+ BinaryTree tree = new BinaryTree();
+ node a = new node(1);
+ node b = new node(1);
+ a.left = new node(2);
+ a.right = new node(3);
+ a.left.left = new node(4);
+ a.left.right = new node(5);
+
+ b.left = new node(4);
+ b.right = new node(2);
+ b.right.left = new node(5);
+ b.right.right = new node(4);
+
+ if (tree.areMirror(a, b))
+ System.out.println("Yes");
+ else
+ System.out.println("No");
+ }
+}