trees

joharbatta · joharbatta · commit 593a86680a26 · 2019-11-05T21:54:37.000+05:30
diff --git a/Queue/queue.java b/Queue/queue.java
@@ -0,0 +1,21 @@
+class Qnode
+{
+    int key;
+    Qnode next;
+
+public Qnode(int key)
+{
+    this.key=key;
+    this.next=null;
+}
+}
+class Queue{
+    Qnode front, rear;
+
+    public Queue()
+    {
+
+        
+        
+    }
+}
diff --git a/Stack/stackLinked.java b/Stack/stackLinked.java
@@ -64,9 +64,8 @@ public static void main(String args[])
         s.push(3);
         s.push(4);
         int x=s.pop();
-        System.out.println(x+ " popped");
-
-
+        System.out.println(x+ " popped");  
 
     }
-}
+    
+    }
diff --git a/Stack/stackop.java b/Stack/stackop.java
@@ -8,7 +8,7 @@ class Stack
     capacity=size;
     }
     void push(int data)
-    {
+    { 
         if(top>=capacity-1)
         {
             System.out.println("Stack is full");
diff --git a/array/revarr.java b/array/revarr.java
@@ -15,7 +15,7 @@ public static void main(String[] args)
 
         for(int i=n-1;i>=0;i--)
          {
-             System.out.print(arr[i]+"  ");
+             System.out.print(arr[i]+"  "); 
          }
 
         
diff --git a/linked list/kthendval.java b/linked list/kthendval.java
@@ -34,10 +34,7 @@ public static void main(String args[])
         }
         int k=sc.nextInt();
         kthfromend(k,n);
-
-        //show();
-        
-
+        //show();     
     }
 
     static void kthfromend(int k,int n)
diff --git a/linked list/link1.java b/linked list/link1.java
@@ -167,3 +167,38 @@ public static void main(String args[]) {
 
 
 
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/linked list/reverseLinked.java b/linked list/reverseLinked.java
@@ -71,12 +71,7 @@ public Node reverse()
         //     current.next=previous;
         //     previous=current;
         //     head=current;
-        // }
-        if(head==null)
-        {
-            return head;
-
-        }
+        // }  
        
         Node current=head;
         Node prev=null;
@@ -91,8 +86,6 @@ public Node reverse()
         }
 
           return prev;
-
-
         }
         //public Node head;
 //        if(head==null)
@@ -131,11 +124,6 @@ public static void main(String args[]) {
     
          list.transverse();
 
-
-
-
-
-
     }
-
+    
 }

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@ class Stack`
`8`	`8`	`capacity=size;`
`9`	`9`	`}`
`10`	`10`	`void push(int data)`
`11`		`- {`
	`11`	`+ {`
`12`	`12`	`if(top>=capacity-1)`
`13`	`13`	`{`
`14`	`14`	`System.out.println("Stack is full");`
Original file line number	Diff line number	Diff line change
`@@ -15,7 +15,7 @@ public static void main(String[] args)`
`15`	`15`
`16`	`16`	`for(int i=n-1;i>=0;i--)`
`17`	`17`	`{`
`18`		`- System.out.print(arr[i]+" ");`
	`18`	`+ System.out.print(arr[i]+" ");`
`19`	`19`	`}`
`20`	`20`
`21`	`21`
Original file line number	Diff line number	Diff line change
`@@ -34,10 +34,7 @@ public static void main(String args[])`
`34`	`34`	`}`
`35`	`35`	`int k=sc.nextInt();`
`36`	`36`	`kthfromend(k,n);`
`37`		`-`
`38`		`- //show();`
`39`		`-`
`40`		`-`
	`37`	`+ //show();`
`41`	`38`	`}`
`42`	`39`
`43`	`40`	`static void kthfromend(int k,int n)`
-Original file line number
+Diff line change
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++
++