BST, Java - rextester

Language: Layout:

import java.util.*;
import java.lang.*;
class Node{
    int data;
    Node left;
    Node right;
    
     Node(int data){
        this.data = data;
        this.left = null;
        this.right = null;
    }
}

class Rextester
{  
    Node root = null;
    public void createNode(int data){
        root = insert(root,data);
    }
    public Node insert(Node root, int data){
        if(root==null){
            root = new Node(data);
            return root;
        }
        else if(root.data > data){
            root.left = insert(root.left,data);
        }
        else{
            root.right = insert(root.right,data);
        }
    return root;
    }
    public void inorder(Node root){
        if(root!=null){
            inorder(root.left);
            System.out.print(root.data + " ");
            inorder(root.right);
        }
    }
     
    public void preorder(Node root){
        if(root!=null){
            System.out.print(root.data + " ");
            preorder(root.left);
            preorder(root.right);
        }
    }
    public void postorder(Node root){
        if(root!=null){
            preorder(root.left);
            preorder(root.right);
            System.out.print(root.data + " ");
        }
    }
    public boolean search(Node root,int data){
         if(root==null)
             return false;
        else if(root.data==data)
            return true;
        else if(root.data > data)
            return search(root.left,data);
        else
            return search(root.right,data);
    }
    public static void main(String args[])
    {
        Rextester r = new Rextester();
        r.createNode(50);
        r.createNode(30);
        r.createNode(20);
        r.createNode(40);
        r.createNode(70);
        r.createNode(60);
        r.createNode(80);
        System.out.println("Inorder");
        r.inorder(r.root);
        System.out.println();
        System.out.println("Preorder");
        r.preorder(r.root);
        System.out.println();
        System.out.println("Postorder");
        r.postorder(r.root);
        System.out.println();
        System.out.println("Data found?" + r.search(r.root,70));
    }
}

[ + ] Show input
Compilation time: 0.73 sec, absolute running time: 0.14 sec, cpu time: 0.12 sec, memory peak: 18 Mb, absolute service time: 0,88 sec