Skip to main content

Tree-NonLinear Data Structure Programming In Java

 /*

Tree is a non-linear Data Structure.

root
|
/------------------------------\
left right
| |
/--------------\ /-----------------\
left right left right
\
\
\
leaf

1.Binary Tree.
2.AVL Tree.
3.Red Black Tree.

*/

//Structure of Tree In Java Class which hold the
Data and pointer of left and right node

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

//Binary Tree Class To Access The node Class
class binaryTree{
node root;
binaryTree(){
root=null;
}

public static void main(String[] args){

binaryTree t=new binaryTree();


t.insert(15);

t.insert(5);

t.insert(10);

t.insert(20);

t.insert(25);

t.traverse(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.left=addNode(root.left,data);
}
else if(root.data<data){
root.right=addNode(root.right,data);
}
else{
return root;
}
return root;
}

//Left->Right->Root
//Right->Left->Root
//Root->Left->Right
//Root->Right->Left

public void Traverse(node root){
if(root!=null){
System.out.println(root.data);
traverse(root.left);
traverse(root.right);
}
}


}
Labels:

Comments

Post a Comment

Popular posts from this blog

LPS(Longest Prefix Which Is Also Suffix) Array Generation Using Java

import java.util.* ; //Longest Prefix Which Is Also Suffix Which Is Used To Found a Pattern Through Avoid Repeated Characters in Given String. We Will Discuss KMP ALGORITHM TO Find A Pattern In Given String Latter. class lbs{ public static void main( String [] args){ Scanner in= new Scanner(System.in); //Get Input From User String s=in.nextLine(); //Convert String Into Char Array char [] ch=s.toCharArray(); int n=s.length(); int [] lbsArr= new int [n]; int j= 0 ,i= 1 ; lbsArr[ 0 ]= 0 ; //LPS ARRAY ALGORITHM /* i=1; j=0; string s="aaab" while i<n if s[i]==s[j]: lpsArr[i]=j; j=j+1 i=i+1 else: if j==0: lbsArr[j]=0 i=i+1 else: ...
1 comment
Read more

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

Sum Of Given Array Elements

public static void main( String [] args){ int [] arr={ 1 , 2 , 3 , 4 , 5 , 6 }; int n=arr.length; int sum= 0 ; for ( int i= 0 ;i<n;i++){ sum+=arr[i]; } System.out.println(sum); } } Java Programming /* Sum Of Given Array Elements Time Complexity O(n) */   class sumOfArray{
Post a Comment
Read more