Program 1 import java.util.*; class TestCollections { public static void main(String args[]) { Scanner scan=new Scanner(System.in); List<Integer>mylist=new ArrayList<Integer>(); int n; System.out.println(“Enter elements in collection for exit press 0”); do { n=scan.nextInt(); if(n==0) break; mylist.add(n);...
Program 1 /// Program for Quick sort import java.util.*; class MyClass { void quick_sort(int ar[],int l,int h) { int low,high,key,temp; low=l; high=h; key=ar[(low+high)/2]; do { while(key>ar[low]) { low++; } while(key<ar[high]) { high–; } if(low<=high)...
Program 1 //Program for insertion sort import java.util.*; class InsertionSort { public static void main(String args[]) { int ar[],n,i,j,temp,k; Scanner scan=new Scanner(System.in); System.out.println(“Enter the limit of array”); n=scan.nextInt(); ar=new int[n]; System.out.println(“Enter elements in array”);...
Program 1 import java.util.*; class MyClass { static boolean searchData(int ar[],int s) { for(int i=0;i<ar.length;i++) { if(ar[i]==s) { return true; } } return false; } } class LinearSearch { public static void main(String args[])...
Program 1 import java.util.*; class TestBST { public static void main(String args[]) { TreeSet<Integer>bst=new TreeSet<Integer>(); Scanner scan=new Scanner(System.in); int choice; do { System.out.println(“————–Binary Search Tree—————-“); System.out.println(“1.Create”); System.out.println(“2.Display”); System.out.println(“3.Search”); System.out.println(“4.Remove”); System.out.println(“5.Exit”); System.out.println(“—————————————————-“); System.out.println(“Enter your choice”);...
Program 1 // Program for Binary Search Tree without collection classes import java.util.*; class BinaryTree { static class Node { Node ladd; int data; Node radd; } Node root=null,new1; void create(Node r,Node new1) {...
Program 1 import java.util.*; class CircularDoubleLinkedList { static class Node { Node ladd; int data; Node radd; } Node start=null,new1,prev1,next1,temp,last; void create() { Scanner scan=new Scanner(System.in); int n; String choice; System.out.println(“Enter an element”); n=scan.nextInt();...
Program 1 // Single Circular linked list import java.util.*; class CircularLinkedList { static class Node { int data; Node add; } Node start=null,new1,temp,next1,prev1,last; void create() { Scanner scan=new Scanner(System.in); int n; String choice; System.out.println(“Enter...
Program 1 import java.util.*; class DoubleLinkedList { static class Node { Node ladd; int data; Node radd; } Node start=null,new1,prev1,next1,temp; void create() { Scanner scan=new Scanner(System.in); int n; System.out.println(“Enter first element”); n=scan.nextInt(); start=new Node();...
Program 1 package dataflair; import java.util.*; public class TestStack { public static void main(String[] args) { int n,choice=0; Scanner scan=new Scanner(System.in); LinkedList<Integer>mystack=new LinkedList<Integer>(); do { System.out.println(“\n—————-Stack Menu—————————“); System.out.println(“1.Push”); System.out.println(“2.Pop”); System.out.println(“3.Display”); System.out.println(“4.Search”); System.out.println(“5.Exit”); System.out.println(“\n——————————————————–“); System.out.println(“\nEnter...
