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

Run Length Encoding | Programming In Java

  Given a string, Your task is to complete the function   encode   that returns the   run-length encoded  string for the given string. eg  if the input string is “wwwwaaadexxxxxx”, then the function should return “w4a3d1e1x6″. You are required to complete the function  encode  that takes only one argument the string which is to be encoded and returns the encoded string. Example 1: Input: str = aaaabbbccc Output: a4b3c3 Explanation: a repeated 4 times consecutively b 3 times, c also 3 times. Example 2: Input: str = abbbcdddd Output: a1b3c1d4 Your Task: Complete the function  encode()  which takes a character array as an input parameter and returns the encoded string. Expected Time Complexity:  O(N), N = length of a given string. Expected Auxiliary Space:  O(1) Constraints: 1<=length of str<=100 Solution: import java.util.*;   class RLEncoding {    public static void main(String[] args)  ...
Post a Comment
Read more

Linked List - Data Structure Basic With Example Java

//linked list /*     Linked List is a Linear Data Structure.      Drawback of Array Is continues Block Of Memory. Linked Is Used To Allocate the Different Memory Location. Each node Contains Data And Pointer. Header Is Used To Denote The First Node Of Linked List. Tail Is Used To Denote the Last Node of The Linked List. 1.Singly Linked List Each Node as Data And pointer To The Next Node. [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]; 2.doubly Linked List Each Node as Data And pointer To The Next Node and prev Node. [ data(header) | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | null]; 3.Circle Linked List [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]-->header */ class...
Post a Comment
Read more