Skip to main content

Height Of Tree-Using Java Programming

 class node{

int data;
node left;
node right;
node(int data){
this.data=data;
}
}

class treeHeight{
node root;

treeHeight(){
root=null;
}

public static void main(String[] args){
treeHeight t=new treeHeight();

t.insert(15);

t.insert(20);

t.insert(10);

t.insert(5);

t.insert(2);

System.out.println(t.height(t.root));

}

public void insert(int data){
root=addNode(root,data);
}

public node addNode(node root,int data){

if(root==null){
return new node(data);
}
else if(root.data<data){
root.right=addNode(root.right,data);
}
else if(root.data>data){
root.left=addNode(root.left,data);
}
else{
return root;
}
return root;
}



/*
15,20,10,5
Regression Is Used To Divide a Huge Problems Into Small Sub Problems.

15
/ \
10 20
/
5


*/

public int height(node root){
if(root==null)
{
return 0;
}
int lheight=height(root.left);
int rheight=height(root.right);

return (lheight>rheight)?lheight+1:rheight+1;
}
}
Labels:

Comments

Post a Comment

Popular posts from this blog

Class is a collection of similar objects. Which have common properties

Class is a collection of similar objects. Which have common properties. Syntax class class_name {        //member functions and variables. } How to create a objects for class class_name c=new class_name; We can access the member variable and member methods using dot operator. c.member_function(); Eg : class bike { void fun() { System.out.println("member method"); } public static void main(String[] args) { bike B=new bike(); B.fun(); } } output member method
Post a Comment
Read more

Array - Java Programming

//Array Is a Basic Data Structure in Computer Programming. Array Have Continues Memory Allocation in Memory Space. Data Are Stored In Continues memory space . We Access Using the index Of The Element. Index Start From 0 to n-1 //Basic Operations in Array /* traverse search find insert Remove */ class array{ //Traverse A Array public static void traverse( int [] arr){ int n=arr.length; for ( int i= 0 ;i<n;i++){ System.out.println(arr[i]); } } //Find Value By Index public static void findByIndex( int [] arr, int index){ System.out.println(arr[index]); } //Find Index By Value public static void findIndex( int [] arr, int value){ int n=arr.length; for ( int i= 0 ;i<n;i++){ if (arr[i]==value){ System.out.println(i); } } } //Insert Function (Array Copy Method) public static void insert( int [] arr, int index, int v...
Post a Comment
Read more