xnorcode

#Add single file
git add README.md
git add original.txt

#Add all files
git add .

xnorcode

...
    
    // DFS post-order print of all values in BST
	static void printPostOrder(Node current){			
		// print left child
		if(current.left != null) printInOrder(current.left);
		
		// print right child
		if(current.right != null) printInOrder(current.right);
		

xnorcode

...

    // DSF pre-order print of all values in BST
	static void printPreOrder(Node current){
		// print current node data
		System.out.println(current.data);
				
		// print left child
		if(current.left != null) printInOrder(current.left);
		

xnorcode

...
  
  	// DFS in-order print of all values of BST
	static void printInOrder(Node current){
		// print left child
		if(current.left != null) printInOrder(current.left);
		
		// print current node data
		System.out.println(current.data);
		

xnorcode

...
  
    // Delete a node in the BST
	static void delete(int val){
		delete(root, val);
	}
	
	// Delete a node in the BST recursive helper method
	private static Node delete(Node current, int val){
		

xnorcode

...

	// Find a node in the BST
	static Node find(int val){
		return find(root, val);
	}
	
	// Find a node in the BST recursive helper method
	private static Node find(Node current, int val){
		

xnorcode

...

public class BinarySearchTree {
	
	// BST Root Node
	private Node root;
	
	
	// Add new node to the BST
	public void add(int val){

xnorcode

...
  
class Node{
		
	int data;

	Node left;

	Node right;

xnorcode

...
    
// Node class
static class Node {

	int data;

	Node next;

	public Node(int data){

xnorcode

...
  
// Method 1

// create array of already known numbers
int[] numbers = {10,2,5,8,37,6};

// printing all numbers
for(int i = 0; i < numbers.length; i++){
	System.out.println(numbers[i]);