BST_withoutgetset

package Datastr;
import java.util.Scanner;

class dem{
	int data;
	dem left,right;
	
	public dem(int data) {
		this.data = data;
		this.left = null;
		this.right = null;
	}
}

class TreeEndsem1{
	dem root = null;
	public dem insert(dem root , int data) {
		if(root == null) {
			return new dem(data);
		}
		if(data < root.data) {
			root.left = insert(root.left,data);
		}
		else {
			root.right = insert(root.right , data);
		}
		return root;
	}
	public static void inorder(dem root) {
		if(root!=null) {
			inorder(root.left);
			System.out.println(root.data);
			inorder(root.right);
		}
	}
	public static void preorder(dem root) {
		if(root!=null) {
			System.out.println(root.data);
			preorder(root.left);
			preorder(root.right);
		}
	}
	public static void postorder(dem root) {
		if(root!=null) {	
			postorder(root.left);
			postorder(root.right);
			System.out.println(root.data);
		}
	}
	public static int max(dem root) {
		while(root.right != null) {
			root = root.right;
		}
		return root.data;
	}
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		TreeEndsem1 tree = new TreeEndsem1();
		dem root = null;
		
		for(int i=0;i<5;i++) {
			System.out.println("Enter value :");
			int tem_val = sc.nextInt();
			root = tree.insert(root, tem_val);
		}
		/*System.out.println("Inorder :");
		inorder(root);
		System.out.println("Preorder :");
		preorder(root);
		System.out.println("Postrder :");
		postorder(root);*/
		System.out.println("Max element in the tree is :"+max(root));
	}
}