diff --git a/.github/workflows/greetings.yml b/.github/workflows/greetings.yml
deleted file mode 100644
index 408781c..0000000
--- a/.github/workflows/greetings.yml
+++ /dev/null
@@ -1,13 +0,0 @@
-name: Greetings
-
-on: [pull_request, issues]
-
-jobs:
- greeting:
- runs-on: ubuntu-latest
- steps:
- - uses: actions/first-interaction@v1
- with:
- repo-token: ${{ secrets.GITHUB_TOKEN }}
- issue-message: 'Thanks for Figuring out'' first issue'
- pr-message: 'Thanks for Your contribution'' first pull request'
diff --git a/.github/workflows/label.yml b/.github/workflows/label.yml
deleted file mode 100644
index 7c724a6..0000000
--- a/.github/workflows/label.yml
+++ /dev/null
@@ -1,19 +0,0 @@
-# This workflow will triage pull requests and apply a label based on the
-# paths that are modified in the pull request.
-#
-# To use this workflow, you will need to set up a .github/labeler.yml
-# file with configuration. For more information, see:
-# https://github.com/actions/labeler
-
-name: Labeler
-on: [pull_request]
-
-jobs:
- label:
-
- runs-on: ubuntu-latest
-
- steps:
- - uses: actions/labeler@v2
- with:
- repo-token: "${{ secrets.GITHUB_TOKEN }}"
diff --git a/.gitignore b/.gitignore
index 5d947ca..afbb4f6 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,18 +1,41 @@
-# Build and Release Folders
-bin-debug/
-bin-release/
-[Oo]bj/
-[Bb]in/
+target/
+!.mvn/wrapper/maven-wrapper.jar
+!**/src/main/**/target/
+!**/src/test/**/target/
-# Other files and folders
-.settings/
+### IntelliJ IDEA ###
+.idea/modules.xml
+.idea/jarRepositories.xml
+.idea/compiler.xml
+.idea/libraries/
+*.iws
+*.iml
+*.ipr
-# Executables
-*.swf
-*.air
-*.ipa
-*.apk
+### Eclipse ###
+.apt_generated
+.classpath
+.factorypath
+.project
+.settings
+.springBeans
+.sts4-cache
-# Project files, i.e. `.project`, `.actionScriptProperties` and `.flexProperties`
-# should NOT be excluded as they contain compiler settings and other important
-# information for Eclipse / Flash Builder.
+### NetBeans ###
+/nbproject/private/
+/nbbuild/
+/dist/
+/nbdist/
+/.nb-gradle/
+build/
+!**/src/main/**/build/
+!**/src/test/**/build/
+
+### VS Code ###
+.vscode/
+
+### Mac OS ###
+.DS_Store
+/.idea/encodings.xml
+/.idea/misc.xml
+/.idea/vcs.xml
diff --git a/.idea/.gitignore b/.idea/.gitignore
new file mode 100644
index 0000000..26d3352
--- /dev/null
+++ b/.idea/.gitignore
@@ -0,0 +1,3 @@
+# Default ignored files
+/shelf/
+/workspace.xml
diff --git a/Collection/.classpath b/Collection/.classpath
deleted file mode 100644
index be383cc..0000000
--- a/Collection/.classpath
+++ /dev/null
@@ -1,7 +0,0 @@
-
-
-
-
-
-
-
diff --git a/Collection/.project b/Collection/.project
deleted file mode 100644
index 4a5ee8d..0000000
--- a/Collection/.project
+++ /dev/null
@@ -1,17 +0,0 @@
-
-
- Collection
-
-
-
-
-
- org.eclipse.jdt.core.javabuilder
-
-
-
-
-
- org.eclipse.jdt.core.javanature
-
-
diff --git a/Collection/images/arraylist_sort.png b/Collection/images/arraylist_sort.png
deleted file mode 100644
index 34d91bb..0000000
Binary files a/Collection/images/arraylist_sort.png and /dev/null differ
diff --git a/Collection/images/arraylist_sort1.png b/Collection/images/arraylist_sort1.png
deleted file mode 100644
index 9147b55..0000000
Binary files a/Collection/images/arraylist_sort1.png and /dev/null differ
diff --git a/Collection/images/arraylist_swapping.png b/Collection/images/arraylist_swapping.png
deleted file mode 100644
index aec3b60..0000000
Binary files a/Collection/images/arraylist_swapping.png and /dev/null differ
diff --git a/Collection/images/asciitable.png b/Collection/images/asciitable.png
deleted file mode 100644
index 45b86af..0000000
Binary files a/Collection/images/asciitable.png and /dev/null differ
diff --git a/Collection/images/reverse_arrayList.png b/Collection/images/reverse_arrayList.png
deleted file mode 100644
index f521694..0000000
Binary files a/Collection/images/reverse_arrayList.png and /dev/null differ
diff --git a/Collection/images/subList1.png b/Collection/images/subList1.png
deleted file mode 100644
index 5fe2f48..0000000
Binary files a/Collection/images/subList1.png and /dev/null differ
diff --git a/Collection/images/sublid2(kmodsize).png b/Collection/images/sublid2(kmodsize).png
deleted file mode 100644
index 7d6034f..0000000
Binary files a/Collection/images/sublid2(kmodsize).png and /dev/null differ
diff --git a/Collection/src/Graphs/package-info.java b/Collection/src/Graphs/package-info.java
deleted file mode 100644
index d1850d6..0000000
--- a/Collection/src/Graphs/package-info.java
+++ /dev/null
@@ -1,9 +0,0 @@
-/**
- *
- */
-/**
- * @author M.NAVEEN
- * RANDOM CODER'S
- * Tech/Project Lead Android Club
- */
-package Graphs;
\ No newline at end of file
diff --git a/Collection/src/Graphs/rep.java b/Collection/src/Graphs/rep.java
deleted file mode 100644
index 5d8d640..0000000
--- a/Collection/src/Graphs/rep.java
+++ /dev/null
@@ -1,43 +0,0 @@
-/**
- *
- */
-package Graphs;
-import java.util.*;
-/**
- * @author M.NAVEEN
- * RANDOM CODER'S
- * Tech/Project Lead Android Club
- */
-public class rep
-{
-
- static ArrayList> graph=new ArrayList>();
-
- public static void main(String ...strings)
- {
- for(int i=0;i<5;i++)
- {
- graph.add(new ArrayList()); //allocates the memeory
- }
-
- System.out.println(graph);
- graph.get(0).add(1);
- graph.get(0).add(4);
- graph.get(1).add(3);
- graph.get(1).add(4);
- graph.get(1).add(0);
- graph.get(2).add(1);
- graph.get(2).add(3);
- graph.get(3).add(1);
- graph.get(3).add(4);
- graph.get(4).add(3);
- graph.get(4).add(0);
-
-
-
- System.out.println(graph);
- }
-
-
-}
-
diff --git a/Collection/src/HashMap/HashMap_to_Set.java b/Collection/src/HashMap/HashMap_to_Set.java
deleted file mode 100644
index d83f84e..0000000
--- a/Collection/src/HashMap/HashMap_to_Set.java
+++ /dev/null
@@ -1,32 +0,0 @@
-/**
- *
- */
-package HashMap;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class HashMap_to_Set
-{
- static HashMap map;
- public HashMap_to_Set(HashMap temp)
- {
- map=new HashMap<>(temp);
- }
-
- public static void main(String[] args)
- {
- new HashMap_to_Set(new HashMaps().map);
- System.out.println("HashMap :\n"+map);
-
- Set s=map.entrySet();
- System.out.println("SET :\n"+s);
- // HashSet k=(HashSet)map.entrySet();
- //java.util.HashMap$EntrySet cannot be cast to java.util.HashSet
- //at HashMap.HashMap_to_Set.main
- //System.out.println(k);
- }
-
-}
diff --git a/Collection/src/HashMap/HashMaps.java b/Collection/src/HashMap/HashMaps.java
deleted file mode 100644
index fc95189..0000000
--- a/Collection/src/HashMap/HashMaps.java
+++ /dev/null
@@ -1,37 +0,0 @@
-/**
- *
- */
-package HashMap;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class HashMaps
-{ static Scanner nav;
- HashMap map;
- public HashMaps()
- {
- nav=new Scanner(System.in);
- map= new HashMap();
- insert_to_Map();
- }
-
- public void insert_to_Map()
- {
- //map.entrySet(1,"NAVEEN");
- map.put(1,"NAVEEN");
- map.put(2,"bala");
- map.put(1,"james");//over writes the naveen
- map.put(0,"praveen");
- map.put(105,"RDJ");
- }
- public static void main(String[] args)
- {
- HashMaps obj =new HashMaps();
- for(Map.Entry x:obj.map.entrySet())
- System.out.println(x.getKey()+" "+x.getValue());
- }
-
-}
diff --git a/Collection/src/HashMap/KeySet_HashMap.java b/Collection/src/HashMap/KeySet_HashMap.java
deleted file mode 100644
index 6fa7d89..0000000
--- a/Collection/src/HashMap/KeySet_HashMap.java
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- *
- */
-package HashMap;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class KeySet_HashMap
-{ static HashMap map;
- public KeySet_HashMap(HashMap map)
- {
- this.map=new HashMap(map);
- }
-
- public static void main(String[] args)
- {
- new KeySet_HashMap(new HashMaps().map) ;
- System.out.println("HASHMAP :"+map);
- Set s=map.keySet();
- System.out.println("Key in hashMap-->map :"+s);
- }
-
-}
diff --git a/Collection/src/HashMap/clone_hashmap.java b/Collection/src/HashMap/clone_hashmap.java
deleted file mode 100644
index 1c63618..0000000
--- a/Collection/src/HashMap/clone_hashmap.java
+++ /dev/null
@@ -1,34 +0,0 @@
-/**
- *
- */
-package HashMap;
-import java.util.HashMap;
-
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class clone_hashmap {
- static HashMap map;
- public clone_hashmap()
- {
- map=new HashMap ();
- }
- public static void main(String[] args)
- {
- new clone_hashmap() ;
- map.putAll(new HashMaps().map);// new HashMaps().map must match map
- System.out.println("Displaying the HaSHMAP :"+map);
- HashMap temp=new HashMap(map);
- HashMap temp2=new HashMap(map);
- System.out.println("Displaying the HaSHMAP :"+temp);
- System.out.println("Displaying the HaSHMAP :"+temp2);
- // HashMap c=map.clone(); Type mismatch: cannot convert from Object to HashMap
- HashMap c=(HashMap)map.clone();
- HashMap c1=(HashMap)map.clone();
- System.out.println("Displaying the HaSHMAP using Clone :"+c);
- System.out.println("Displaying the HaSHMAP using Clone :"+c1);
- }
-
-}
diff --git a/Collection/src/HashMap/collection_view_values.java b/Collection/src/HashMap/collection_view_values.java
deleted file mode 100644
index acdac8d..0000000
--- a/Collection/src/HashMap/collection_view_values.java
+++ /dev/null
@@ -1,30 +0,0 @@
-/**
- *
- */
-package HashMap;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class collection_view_values
-{
- static HashMap map;
- public collection_view_values(HashMap map)
- {this.map=new HashMap(map);
- }
-
- public static void main(String[] args)
- {
- new collection_view_values(new HashMaps().map);
- System.out.println("Hash Map :"+map);
- System.out.println("collection of values"+map.values());
- //ArrayList list= (ArrayList)map.values();
- //System.out.println("collection of values"+map.values()); output-java.util.HashMap$Values cannot be cast to java.util.ArrayList
- //at HashMap.collection_view_values.main(collection_view_values.java:23)
- ArrayList list= new ArrayList(map.values());
- System.out.println("ArrayList of values"+list);
- }
-
-}
diff --git a/Collection/src/HashMap/get_value.java b/Collection/src/HashMap/get_value.java
deleted file mode 100644
index af598ac..0000000
--- a/Collection/src/HashMap/get_value.java
+++ /dev/null
@@ -1,36 +0,0 @@
-/**
- *
- */
-package HashMap;
-import java.util.*;
-import java.util.HashMap;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class get_value
-{ static Scanner nav=new Scanner(System.in);
- static HashMap h;
- public get_value(HashMap temp)
- {
- h=new HashMap (temp);
- }
-
- public static void main(String[] args)
- {
- new get_value(new HashMaps().map);
- System.out.println("HASH MAP :"+h);
- System.out.print("Enter the key :");
- int ele=nav.nextInt();
- if(h.containsKey(ele))
- {
- System.out.println("value exists!!="+h.get(ele));
- }
- else
- { System.out.println("value Doesnot exists!!=");//h.get(ele)=null
- }
-
- }
-
-}
diff --git a/Collection/src/HashMap/hashmap_count_size.java b/Collection/src/HashMap/hashmap_count_size.java
deleted file mode 100644
index b9d050e..0000000
--- a/Collection/src/HashMap/hashmap_count_size.java
+++ /dev/null
@@ -1,28 +0,0 @@
-/**
- *
- */
-package HashMap;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class hashmap_count_size
-{
- static HashMap map;
- public hashmap_count_size()
- {
- map= new HashMap();
- }
-
- public static void main(String[] args)
- { new hashmap_count_size();
- map.put(-1,"10");
- map.put(-2,"9");
- map.put(-3,"8");
-
- System.out.print("SIze of HashMap :"+map.size());
- }
-
-}
diff --git a/Collection/src/HashMap/package-info.java b/Collection/src/HashMap/package-info.java
deleted file mode 100644
index c5daf3e..0000000
--- a/Collection/src/HashMap/package-info.java
+++ /dev/null
@@ -1,9 +0,0 @@
-/**
- *
- */
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-package HashMap;
\ No newline at end of file
diff --git a/Collection/src/HashMap/remove_all_mapping.java b/Collection/src/HashMap/remove_all_mapping.java
deleted file mode 100644
index 045d676..0000000
--- a/Collection/src/HashMap/remove_all_mapping.java
+++ /dev/null
@@ -1,30 +0,0 @@
-/**
- *
- */
-package HashMap;
-import java.util.HashMap;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class remove_all_mapping {
- static HashMap h;
- public remove_all_mapping()
- {
- h=new HashMap<>();
- }
-
- public static void main(String[] args)
- {
- new remove_all_mapping ();
- h.putAll(new HashMaps().map);
- System.out.println("Mapping "+h);
- h.remove(0);
- System.out.println("Mapping After removing Key-0 :"+h);
- h.clear();
- System.out.println("Mapping After removing all Keys :"+h);
-
- }
-
-}
diff --git a/Collection/src/HashMap/search.java b/Collection/src/HashMap/search.java
deleted file mode 100644
index 682c857..0000000
--- a/Collection/src/HashMap/search.java
+++ /dev/null
@@ -1,39 +0,0 @@
-/**
- *
- */
-package HashMap;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class search {
- static HashMap map;
- static Scanner nav;
- public search()
- { nav=new Scanner(System.in);
- map=new HashMap();
- }
-
- public static void main(String[] args)
- { new search();
- map.put(1,"red");
- map.put(2,"blue");
- map.put(3,"yellow");
- System.out.println("HashMap :"+map);
- System.out.println("Enter to check if the Key is present :");
- if(map.containsKey(nav.nextInt()))
- System.out.println("Is present");
- else
- System.out.println("Not present");
- System.out.println("Enter to check if the Value is present :");
- if(map.containsValue(nav.next())) //if nav.nextInt() the output is "Value Not present"
- {
- System.out.println("Is present");
- }
- else
- System.out.println("Value Not present");
- }
-
-}
diff --git a/Collection/src/Hashset/append_hashset.java b/Collection/src/Hashset/append_hashset.java
deleted file mode 100644
index 52e2850..0000000
--- a/Collection/src/Hashset/append_hashset.java
+++ /dev/null
@@ -1,32 +0,0 @@
-/**
- *
- */
-package Hashset;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class append_hashset
-{
- static HashSet h;
-
- public append_hashset()
- {
- h= new HashSet<>();
- }
-
- public static void main(String ... arg)
- { //HashSet is faster but doesnot maintain any order
- System.out.println("IMPLEMENTING HASHSET");
- new append_hashset();
- int a[]={1,2,3,1,4,5,5,7,8,9,1,5,6,0,20,9,0,100,56};
- System.out.println("Displaying the array -"+Arrays.toString(a));
- for(int i=0;i"+h); //h.size<=a.length always .
- }
-}
diff --git a/Collection/src/Hashset/common_element.java b/Collection/src/Hashset/common_element.java
deleted file mode 100644
index 21b1043..0000000
--- a/Collection/src/Hashset/common_element.java
+++ /dev/null
@@ -1,39 +0,0 @@
-/**
- *
- */
-package Hashset;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-
-public class common_element
-{
- static HashSet h1;
- static HashSet h2;
- public common_element ()
- {
- h1=new HashSet();
- h2=new HashSet();
- }
-
- public static void main(String[] args)
- {
- new common_element();
- h1.add("Life") ;
- h1.add("My");
- h1.add("Pie");
- System.out.println("Displaying HashSet h1"+h1);
- h2.add("My");
- h2.add("my");
- h2.add("Pie");
- h2.add("red");
- System.out.println("Displaying HashSet h2"+h2);
- System.out.println("Common Element :");
- h1.retainAll(h2);
- System.out.println("After retaining HashSet h1 :"+h1);
- }
-
-}
diff --git a/Collection/src/Hashset/compare_hashset.java b/Collection/src/Hashset/compare_hashset.java
deleted file mode 100644
index 42c4d72..0000000
--- a/Collection/src/Hashset/compare_hashset.java
+++ /dev/null
@@ -1,39 +0,0 @@
-/**
- *
- */
-package Hashset;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class compare_hashset
-{
- static HashSet h1;
- static HashSet h2;
- public compare_hashset()
- {
- h1=new HashSet();
- h2=new HashSet();
- }
-
- public static void main(String[] args)
- {
- new compare_hashset();
- h1.add("Life") ;
- h1.add("My");
- h1.add("Pie");
- System.out.println("Displaying HashSet h1"+h1);
- h2.add("My");
- h2.add("my");
- h2.add("Pie");
- h2.add("red");
- System.out.println("Displaying HashSet h2"+h2);
- for(String temp:h2)
- {
- System.out.println((h1.contains(temp)?"Yes":"No"));
- }
- }
-
-}
diff --git a/Collection/src/Hashset/covert_to_list.java b/Collection/src/Hashset/covert_to_list.java
deleted file mode 100644
index 3c6ae0b..0000000
--- a/Collection/src/Hashset/covert_to_list.java
+++ /dev/null
@@ -1,34 +0,0 @@
-/**
- *
- */
-package Hashset;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class covert_to_list
-{
- static HashSet h;
- public covert_to_list()
- {
- h= new HashSet();
- }
- public static void addition()
- {
- int a[]={1,2,1,3,0,5,0,5,6,1,6,7,5,7,5,8,9};
- for(int i=0;i l=new ArrayList(h);
- LinkedList L=new LinkedList(h);
- System.out.println("ArrayList :"+l+"\nLinkedList :"+L);
- }
-
-}
diff --git a/Collection/src/Hashset/covert_to_treeset.java b/Collection/src/Hashset/covert_to_treeset.java
deleted file mode 100644
index 109ec22..0000000
--- a/Collection/src/Hashset/covert_to_treeset.java
+++ /dev/null
@@ -1,36 +0,0 @@
-/**
- *
- */
-package Hashset;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class covert_to_treeset
-{
- static HashSet h;
- public covert_to_treeset()
- {
- h=new HashSet();
- }
- public static void addition()
- {
- int a[]={1,2,1,3,0,5,0,5,6,1,6,7,5,7,5,8,9};
- for(int i=0;i t=new TreeSet(h);
- for(Integer tree:t)
- System.out.println(" "+tree);
-
-
- }
-
-}
diff --git a/Collection/src/Hashset/display_hashset.java b/Collection/src/Hashset/display_hashset.java
deleted file mode 100644
index a4c95c5..0000000
--- a/Collection/src/Hashset/display_hashset.java
+++ /dev/null
@@ -1,43 +0,0 @@
-/**
- *
- */
-package Hashset;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class display_hashset
-{
- static HashSet h;
- public display_hashset()
- {
- h=new HashSet();
- }
- public static void addition()
- {
- int a[]={1,2,1,3,0,5,0,5,6,1,6,7,5,7,5,8,9};
- for(int i=0;i h;
- public hashset_array()
- {
- h=new HashSet();
- }
- public static void addition()
- {
- int a[]={0,0,0,3,3,3,1,2,1,4,6,5,7,8,8,9,9,9};
- for(int i=0;i h1;
- public remove()
- {
- h1=new HashSet();
- }
-
- public static void main(String[] args)
- {
- new remove();
- h1.add("Life") ;
- h1.add("My");
- h1.add("Pie");
- System.out.println("Displaying HashSet h1"+h1);
- h1.remove("Life");
- System.out.println("After Removing HashSet h1"+h1);
- }
-
-}
diff --git a/Collection/src/PriorityQueue/package-info.java b/Collection/src/PriorityQueue/package-info.java
deleted file mode 100644
index 5b626a0..0000000
--- a/Collection/src/PriorityQueue/package-info.java
+++ /dev/null
@@ -1,16 +0,0 @@
-/**
- *
- */
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-package PriorityQueue;
-//PriorityQueue doesn’t permit null.
-/*
- * PriorityQueue are unbound queues.
- * PriorityQueue(int initialCapacity):
- * Creates a PriorityQueue with the specified initial capacity that
- * orders its elements according to their natural ordering.
- */
diff --git a/Collection/src/TREES/TressDemo.java b/Collection/src/TREES/TressDemo.java
deleted file mode 100644
index 1a510d9..0000000
--- a/Collection/src/TREES/TressDemo.java
+++ /dev/null
@@ -1,83 +0,0 @@
-/**
- *
- */
-package TREES;
-import java.util.*;
-
-/**
- * @author M.NAVEEN
- * RANDOM CODER'S
- * Tech/Project Lead Android Club
- */
-public class TressDemo
-{
- static Scanner nav =new Scanner(System.in);
-
- static class node {
- node left,right;
- int data;
-
- node (int data){this.data =data;}
- }
- public static node createTree()
- { node root =null;
- System.out.println("Enter the Data :");
- int data=nav.nextInt();
- if(data==-1) {
- return null;
- }
-
- root =new node(data);
- System.out.println("The data entered on Left :"+data);
- root.left =createTree();
- System.out.println("The data entered on Right :"+data);
- root.right=createTree();
-
-
- return root;
-
- }
-
- public static void inOrder(node root)
- {
- if(root ==null) {return ;}
-
- inOrder(root.left);
- System.out.print(root.data +" ");
- inOrder(root.right);
- }
-
- public static void PerOrder(node root)
- {
- if(root ==null) {return ;}
- System.out.print(root.data +" ");
- PerOrder(root.left);
-
- PerOrder(root.right);
- }
-
- public static void PostOrder(node root)
- {
- if(root ==null) {return ;}
-
- PostOrder(root.left);
-
- PostOrder(root.right);
- System.out.print(root.data +" ");
- }
-
- public static void main(String[] args)
- {
- System.out.println("Tree");
- node root =createTree();
- System.out.println("Inorder !!!!");
- inOrder(root);
-
- System.out.println("\nPostorder !!!!");
- PostOrder(root);
- System.out.println("\nPreOrder !!!!");
- PerOrder(root);
- }
-
-}
-
diff --git a/Collection/src/TREES/package-info.java b/Collection/src/TREES/package-info.java
deleted file mode 100644
index b25f6f6..0000000
--- a/Collection/src/TREES/package-info.java
+++ /dev/null
@@ -1,9 +0,0 @@
-/**
- *
- */
-/**
- * @author M.NAVEEN
- * RANDOM CODER'S
- * Tech/Project Lead Android Club
- */
-package TREES;
\ No newline at end of file
diff --git a/Collection/src/TreeSet/Clone_treeset.java b/Collection/src/TreeSet/Clone_treeset.java
deleted file mode 100644
index a8a4c0f..0000000
--- a/Collection/src/TreeSet/Clone_treeset.java
+++ /dev/null
@@ -1,31 +0,0 @@
-/**
- *
- */
-package TreeSet;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class Clone_treeset
-{ static TreeSet t;
- public Clone_treeset()
- {
- t=new TreeSet();
- }
-
- public static void main(String[] args)
- {
- System.out.println ("Implementing TreeSet :");
- new Clone_treeset() ;
- int a[]={1,2,3,4,5,6,7,8,9,0,0,1,50};
- for(int c:a)
- t.add(c);
- System.out.println(" Displaying the TreeSet \n"+t);
- //TreeSet t2=t.clone(); error can not convert object to treeset
- TreeSet t2=(TreeSet) t.clone();
- System.out.println(" Displaying the TreeSet \n"+t2);
- }
-
-}
diff --git a/Collection/src/TreeSet/Display_treeSet.java b/Collection/src/TreeSet/Display_treeSet.java
deleted file mode 100644
index bb32974..0000000
--- a/Collection/src/TreeSet/Display_treeSet.java
+++ /dev/null
@@ -1,37 +0,0 @@
-/**
- *
- */
-package TreeSet;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class Display_treeSet
-{
- static TreeSet t;
- static TreeSet t1;
- public Display_treeSet()
- {
- t=new TreeSet();
- t1=new TreeSet();
- }
-
- public static void main(String[] args)
- {
- new Display_treeSet ();
- int a[]={1,2,3,4,5,6,7,8,9,0,50};
- for(int c:a)
- t.add(c);
- System.out.print("Integer Tree :");
- for(Integer c:t)
- System.out.print(" "+c);
- for(int c:a)
- t1.add(""+c);
- System.out.print("\nString Tree :");
- for(String c:t1)
- System.out.print(" "+c);
- }
-
-}
diff --git a/Collection/src/TreeSet/Greater_than_equal.java b/Collection/src/TreeSet/Greater_than_equal.java
deleted file mode 100644
index ce3af89..0000000
--- a/Collection/src/TreeSet/Greater_than_equal.java
+++ /dev/null
@@ -1,35 +0,0 @@
-/**
- *
- */
-package TreeSet;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class Greater_than_equal
-{
- static TreeSet t;
- static TreeSet t2;
- static Scanner nav;
- public Greater_than_equal()
- {
- t=new TreeSet();
- nav=new Scanner(System.in);
- }
-
- public static void main(String[] args)
- {
- System.out.println ("Implementing TreeSet :");
- new Greater_than_equal();
- int a[]={1,4,6,8,10,15,20,44,0,0,1,50};
- for(int c:a)
- t.add(c);
- System.out.println(" Displaying the TreeSet \n"+t);
- System.out.println("Enter the number x to get number Greater than equal to Number:");
- System.out.println(t.ceiling(nav.nextInt()));
-
- }
-
-}
diff --git a/Collection/src/TreeSet/Tree.java b/Collection/src/TreeSet/Tree.java
deleted file mode 100644
index 9d77585..0000000
--- a/Collection/src/TreeSet/Tree.java
+++ /dev/null
@@ -1,38 +0,0 @@
-/**
- * Tree set maintain \s sorted order (asc).
- */
-package TreeSet;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class Tree
-{
- static TreeSet t;
- public Tree()
- {
- t=new TreeSet();
- }
-
- public static void main(String[] args)
- {
- new Tree();
- addition();
- }
-
- /**
- *
- */
- private static void addition()
- {
- int a[]={0,0,3,5,8,9,8,7,100,9};
- for(int i=0;it;
- static TreeSet t2;
- static TreeSet t3;
- public add_to_tree()
- {
- t=new TreeSet();
- t2=new TreeSet(t);
- t3=new TreeSet();
- }
-
- public static void main(String[] args)
- {
- new add_to_tree ();
- int a[]={1,2,3,4,5,6,7,8,9,0,50};
- for(int c:a)
- t.add(c);
- System.out.println("Integer Tree T1:"+t); //mutiple wasy to add elemts to another TreeSet
- t2=new TreeSet(t);
- System.out.println("INTEGER TREE T2:"+t2);
- t3.addAll(t2);
- System.out.println("INTEGER TREE T3:"+t3);
- }
-
-}
diff --git a/Collection/src/TreeSet/getelement_tree.java b/Collection/src/TreeSet/getelement_tree.java
deleted file mode 100644
index 9143cd7..0000000
--- a/Collection/src/TreeSet/getelement_tree.java
+++ /dev/null
@@ -1,33 +0,0 @@
-/**
- *
- */
-package TreeSet;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class getelement_tree
-{
- static TreeSet t;
- public getelement_tree()
- {
- t=new TreeSet();
- }
-
- public static void main(String[] args)
- {
-
- System.out.println ("Implementing TreeSet :");
- new getelement_tree() ;
- int a[]={1,2,3,4,5,6,7,8,9,0,0,1,50};
- for(int c:a)
- t.add(c);
- System.out.println(" Displaying the TreeSet \n"+t);
- System.out.println("Root:"+t.first());
- System.out.println("Last element:"+t.last());
-
- }
-
-}
diff --git a/Collection/src/TreeSet/less_than.java b/Collection/src/TreeSet/less_than.java
deleted file mode 100644
index f66fd99..0000000
--- a/Collection/src/TreeSet/less_than.java
+++ /dev/null
@@ -1,33 +0,0 @@
-/**
- *
- */
-package TreeSet;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class less_than
-{ static Scanner nav;
- static TreeSet t;
- public less_than()
- { nav=new Scanner(System.in);
- t=new TreeSet();
- }
-
- public static void main(String[] args)
- {
- System.out.println ("Implementing TreeSet :");
- new less_than();
- int a[]={1,4,6,8,10,15,20,44,0,0,1,50};
- for(int c:a)
- t.add(c);
- System.out.println(" Displaying the TreeSet \n"+t);
- System.out.println("Enter the number x to get number Lesser than to Number:");
- // lesser than only not lesser than equal to eq is number is x=10 then output is :8
- System.out.println(t.lower(nav.nextInt()));
- // if x=0,the output is null.
- }
-
-}
diff --git a/Collection/src/TreeSet/less_than_num.java b/Collection/src/TreeSet/less_than_num.java
deleted file mode 100644
index c6afffe..0000000
--- a/Collection/src/TreeSet/less_than_num.java
+++ /dev/null
@@ -1,36 +0,0 @@
-/**
- *
- */
-package TreeSet;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class less_than_num
-{
- static TreeSet t;
- static TreeSet temp;
- static Scanner nav;
- public less_than_num()
- {
- t=new TreeSet();
- temp=new TreeSet();
- nav=new Scanner(System.in);
- }
-
- public static void main(String[] args)
- {
- System.out.println ("Implementing TreeSet :");
- new less_than_num() ;
- int a[]={1,2,3,4,5,6,7,8,9,0,0,1,50};
- for(int c:a)
- t.add(c);
- System.out.println(" Displaying the TreeSet \n"+t);
- System.out.println("Enter the number x:");
- temp=(TreeSet)t.headSet(nav.nextInt());
- System.out.print("Number's less x in Treeset t :"+temp);
- }
-
-}
diff --git a/Collection/src/TreeSet/package-info.java b/Collection/src/TreeSet/package-info.java
deleted file mode 100644
index 3fe9e67..0000000
--- a/Collection/src/TreeSet/package-info.java
+++ /dev/null
@@ -1,18 +0,0 @@
-/**
- *
- */
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-package TreeSet;
-/*TreeSet maintains an object in sorted order
- * HashSet allows null object. TreeSet doesn’t allow null Object and throw NullPointerException,
- * Why, because TreeSet uses compareTo() method to compare keys and
- * compareTo() will throw java.lang.NullPointerException.
- * If you want a sorted Set then it is better to add elements to HashSet
- * and then convert it into TreeSet rather than creating a TreeSet and adding elements to it.
- * url=https://stackoverflow.com/questions/1463284/hashset-vs-treeset
- *
- */
diff --git a/Collection/src/TreeSet/remove_last.java b/Collection/src/TreeSet/remove_last.java
deleted file mode 100644
index 52f23a6..0000000
--- a/Collection/src/TreeSet/remove_last.java
+++ /dev/null
@@ -1,33 +0,0 @@
-/**
- *
- */
-package TreeSet;
-import java.util.*;
-/**
- * @author M.NAVEEN
- RANDOM CODER'S
- *
- */
-public class remove_last
-{
- static TreeSet