Skip to main content

Driver Program to Test Tree in JAVA

Driver Program to Test Tree:-

A basic driver program to test all the functions that i will posting in my blogs using this sample tree.







package com.BST;

public class BSTOperation {

 /**
  * @param args
  */
 public static void main(String[] args) {
  
  BinarySearchTree btree=new BinarySearchTree();
  btree.inorder(btree.root);
  Node node1=new Node(8);
  Node node2=new Node(3);
  Node node3=new Node(1);
  Node node4=new Node(6);
  Node node5=new Node(4);
  Node node6=new Node(7);
  Node node7=new Node(10);
  Node node8=new Node(14);
  Node node9=new Node(13);
  
  btree.root=btree.insert(node1, btree.root);
  btree.inorder(btree.root);
  System.out.println("");
  btree.root=btree.insert(node2, btree.root);
  btree.inorder(btree.root);
  System.out.println("");
  btree.root=btree.insert(node3, btree.root);
  btree.inorder(btree.root);
  System.out.println("");
  btree.root=btree.insert(node4, btree.root);
  btree.inorder(btree.root);
  System.out.println("");
  btree.root=btree.insert(node5, btree.root);
  btree.inorder(btree.root);
  System.out.println("");
  btree.root=btree.insert(node6, btree.root);
  btree.inorder(btree.root);
  System.out.println("");
  btree.root=btree.insert(node7, btree.root);
  btree.inorder(btree.root);
  System.out.println("");
  btree.root=btree.insert(node8, btree.root);
  btree.inorder(btree.root);
  System.out.println("");
  btree.root=btree.insert(node9, btree.root);
  System.out.println("Inorder");
  btree.inorder(btree.root);
  System.out.println("");
  System.out.println("post order");
  btree.postOrder(btree.root);
  System.out.println("");
  System.out.println("pre order");
  btree.preOrder(btree.root);
 }

}

Comments

.

Popular posts from this blog

Driver program to perform operations in graph

Driver program to perform operations in graph:-



package com.problems.graph;publicclassGraphDriver{publicstaticvoidmain(String[] args){ BFSGraph g=new BFSGraph(); g.addVertex('A'); g.addVertex('B'); g.addVertex('C'); g.addVertex('D'); g.addVertex('E'); g.addVertex('F'); g.addVertex('G'); g.addVertex('H'); g.addEdge(0,1); g.addEdge(1,2); g.addEdge(1,7); g.addEdge(2,3); g.addEdge(2,4); g.addEdge(7,4); g.addEdge(4,5); g.addEdge(4,6); g.bfs();}}

Shortest Path from source to Vertex :- Dijkstra Algorithm

Shortest Path from source to Vertex :- Dijkstra Algorithm:-

Dijkstra Algorithms is an algorithm use to find the shortest path from source vertex to a given vertex.



package Graph;importjava.util.HashMap;abstractpublicclassDirectedGraph{ Vertex[] vertexlist=new Vertex[10]; HashMap<Character,HashMap<Character,Integer>> edgelist=new HashMap<>(); Vertex vertex;//count of vertex and edgestaticint vertexcount=0;int edgecount=0;/* * This function takes a label and insert in the vertex list as well as edge list since it is new vertex it will add * null to its adjoining vertices */intaddVertex(char label){ vertex=new Vertex(label); vertexlist[vertexcount]=vertex; System.out.println(vertexlist[vertexcount].label); edgelist.put(vertex.label,null); vertexcount++;return vertexcount;}intaddEdge(char label,char[] labels,int[] distances){ HashMap<Character,Integer> vertexlist=new HashMap<>();for(int i=0;i<labels.length;i++){ vertexlist.put(labels[i],…