neer2808

neer2808 / kruskal_demo.java

Created April 27, 2022 16:15

	package kruskals;

	import java.util.Arrays;
	import java.util.Scanner;

	class Edge implements Comparable<Edge>
	{
	int v1;
	int v2;
	int weight;

neer2808 / Prims.java

Created April 27, 2022 05:20

	package prims_algorithm;

	import java.util.Scanner;

	public class Prims {
	public static void prims(int matrix[][])
	{
	int n = matrix.length;
	boolean visited[] = new boolean[n];
	int parent[] = new int[n];

neer2808 / Graph1.java

Created April 22, 2022 11:12

	package graph;
	import java.util.*;
	public class Graph1 {
	HashMap<Integer, List<Integer>>obj;
	public Graph1()
	{
	obj = new HashMap<Integer,List<Integer>>();
	}

	// Single Source Shortest Path using BFS

neer2808 / ThreadedBT.java

Created April 13, 2022 06:15

	package threadedbinarytree;
	class Node
	{
	int data;
	Node left;
	Node right;
	boolean leftthread;
	boolean rightthread;
	public Node(int data)
	{

neer2808 / BSTSearch.java

Created April 12, 2022 06:19

	package BSTSearchPath;

	import java.util.ArrayList;
	import java.util.Iterator;

	public class BSTSearch {


	// deletion in Binary search tree

neer2808 / BTest.java

Created April 12, 2022 06:14

neer2808 / AVLDemo.java

Created April 12, 2022 06:13

neer2808 / Test.java

Created April 8, 2022 15:08

	import java.lang.invoke.SwitchPoint;

	public class Test {
	public static void main(String[] args) {
	String str = "two four triple three";
	String ans = "";
	String strArray[] = str.split(" ");
	String ans1="";
	System.out.println("String : " + str);
	for (int i = 0; i < strArray.length; i++) {

neer2808 / Test.java

Created April 8, 2022 14:25

	import java.lang.invoke.SwitchPoint;

	public class Test {
	public static void main(String[] args) {
	String str = "three four eight nine four";

	String ans = "";
	String strArray[] = str.split(" ");

	System.out.println("String : " + str);

neer2808 / BSTSearch.java

Created April 6, 2022 05:50

	package BSTSearchPath;

	import java.util.ArrayList;
	import java.util.Iterator;

	public class BSTSearch {
	public static void insert(Node root,Node newnode)
	{
	if(root== null)
	{