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

Selection Sort in JAVA

What is selection sort? It is a sorting technique that is based on the partitioning of array into two parts, sorted and unsorted. The process is:- 1) Find minimum element in unsorted array. 2) Swap the element at the end of sorted array. when i=0 we don't have any sorted array so element will be replaced from first element later the sorted array end will growas the index. Steps:- underline elements are sorted array, the length is increasing with each minimum element added at the end. minimum element11 11 25 12 22 64 minimum element12 11 12 25 22 64 minimum element22 11 12 22 25 64 minimum element25 11 12 22 25 64 minimum element64 11 12 22 25 64 Program:- package sorting ; public class SelectionSort { //function to print array public static void print ( int [] arr ) { for ( int i = 0 ; i <= arr . length - 1 ; i ++) System . out . print ( " " + arr [ i ]); System . out . printl

Best LeetCode Lists for Interviews

Here is a list of some of the best questions asked in interviews:-  Must do 75 https://leetcode.com/list/5hkn6wze/ Must do 60  https://leetcode.com/list/5eie1aqd/ Must do medium:-  https://leetcode.com/list/5xaelz7g/ Must do Easy:-   https://leetcode.com/list/5r7rxpr1/ Graph:-  https://leetcode.com/list/x18ervrd/  Dynamic Programming:-    https://leetcode.com/list/x14z0dxr/  FaceBook interviews:- https://leetcode.com/list/xyu98pv6/  Amazon Interviews:-  https://leetcode.com/list/5hkniyf7/  Google Interviews:- https://leetcode.com/list/xyu9xfo1/ https://github.com/nazarmubeen/TopProblems/blob/master/README.md