08/09/2019

Author: anubhav1006

src/DSA/Trees/TreeToMirrorTree.java

@@ -0,0 +1,44 @@
+package DSA.Trees;
+
+public class TreeToMirrorTree {
+ static class node{
+ int key;
+ node left, right;
+
+ public node(int key) {
+ this.key = key;
+ left = right = null;
+ }
+ }
+
+ static void convert(node root){
+ if(root ==null)
+ return;
+
+ node temp = root.left;
+ root.left = root.right;
+ root.right = temp;
+
+ convert(root.left);
+ convert(root.right);
+ }
+
+ static void inorder(node root){
+ if(root==null)
+ return;
+ inorder(root.left);
+ System.out.print(root.key+" ");
+ inorder(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);
+
+ convert(root);
+ inorder(root);
+ }
+}

src/DSA/Trees/TreetoSumTree.java

@@ -0,0 +1,46 @@
+package DSA.Trees;
+
+public class TreetoSumTree {
+ static class node{
+ int key;
+ node left, right;
+
+ public node(int key) {
+ this.key = key;
+ left = right = null;
+ }
+ }
+
+ static int convert(node root){
+ if(root==null){
+ return 0;
+ }
+
+ int data = root.key;
+ root.key = convert(root.left)+convert(root.right);
+
+ return data+root.key;
+
+ }
+ static void inorder(node root){
+ if(root==null)
+ return;
+ inorder(root.left);
+ System.out.print(root.key+" ");
+ inorder(root.right);
+ }
+
+ public static void main(String[] args) {
+ node root = new node(10);
+ root.left = new node(-2);
+ root.right = new node(6);
+ root.left.left = new node(8);
+ root.left.right = new node(-4);
+ root.right.left = new node(7);
+ root.right.right = new node(5);
+
+ convert(root);
+ inorder(root);
+
+ }
+}