KnowledgeShare

Tree Traversal Implementation: public class Node { public int data ; public Node leftNode ; public Node rightNode ; Node( int Data ){ this . data = Data ; this . leftNode = null ; this . rightNode = null ; } } public class Traversal { public void inOrder(Node n ) { if ( n == null ) return ; inOrder( n . leftNode ); System. out .println( n . data ); inOrder( n . rightNode ); } public void preOrder(Node n ) { if ( n == null ) return ; System. out .println( n . data ); preOrder( n . leftNode ); preOrder( n . rightNode ); } public void postOrder(Node n ) { if ( n == null ) return ; postOrder( n . leftNode ); postOrder( n . rightNode ); System. out .println( n . data ); } } public class main { public static void main(String s []) { Node n1 = new Node(5); Node n2 = new Node(3); Node n3 = new Node(2); N...

Selection Sort: The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning. arr[] = 64 25 12 22 11 // Find the minimum element in arr[0...4] // and place it at beginning 11 25 12 22 64 // Find the minimum element in arr[1...4] // and place it at beginning of arr[1...4] 11 12 25 22 64 // Find the minimum element in arr[2...4] // and place it at beginning of arr[2...4] 11 12 22 25 64 // Find the minimum element in arr[3...4] // and place it at Insertion Sort: Merge Short. QuickSort 2.9 Like  Merge Sort , QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot.  There are many different versions of quickSort that pick pivot in different ways. Always pick first element as pivot. Always pick last elem...