Skip to main content

How to design a Node in Tree?

How to design a Node in Tree?

There are three main components of a tree in a node.

 1) Integer holding data.
2) Left pointer holding node in a left subtree.
3) Right pointer holding node in a right subtree.

The following design is having data of int type and left,right pointers of a node to the subtrees.


package com.BST;

public class Node {

 int data;
 Node left;
 Node right;
 /**
  * @return the data
  */
 public Node(int data)
 {
  this.left=null;
  this.right=null;
  this.data=data;
 }
 
 public int getData() {
  return data;
 }
 /**
  * @param data the data to set
  */
 public void setData(int data) {
  this.data = data;
 }
 /**
  * @return the left
  */
 public Node getLeft() {
  return left;
 }
 /**
  * @param left the left to set
  */
 public void setLeft(Node left) {
  this.left = left;
 }
 /**
  * @return the right
  */
 public Node getRight() {
  return right;
 }
 /**
  * @param right the right to set
  */
 public void setRight(Node right) {
  this.right = right;
 }
 /* (non-Javadoc)
  * @see java.lang.Object#toString()
  */
 @Override
 public String toString() {
  return "Node [data=" + data + ", left=" + left + ", right=" + right
    + "]";
 }
 
 

}

Comments

.

Popular posts from this blog

Deleting a Node by passing data in LInkedList

Deleting a Node by passing data in LInkedList:-

The node can be deleted by passing the data value in a function.Here we have three pointers one to traverse the list other to point current node and third one to point previous of current node.



//deleting a given keypublic Node deleteKeyNode(Node head,int key){//traverse pointer Node temp=head;//previous pointer Node prevtemp=temp;while(temp!=null){//when key is at head positionif(key==head.data){ head=head.next; System.out.println("head is deleted");return head;}//when key is at any position other than headif(temp.data==key){ prevtemp.next=temp.next; temp.next=null; temp=prevtemp;} prevtemp=temp; temp=temp.next;}return head;}