Skip to main content

Tree Traversal in JAVA (InOder/preOrder/postOrder)

Tree Traversal in JAVA (InOder/preOrder/postOrder):-

Tree traversal can be done through three ways.

1)Inorder:-

Go recursively to the left node.
Read a node
Go recursively to the right node.

2)Pre Order.

Read a node
Go recursively to the left node.
Go recursively to the right node.


2)Post Order.


Go recursively to the left node.
Go recursively to the right node.
Read a node



public void inorder(Node root)
 {
  
  if(root==null)
  {
  return;
  }
  
  inorder(root.left);
  System.out.print(root.data+",");
  inorder(root.right);
  
  }
 
 public void preOrder(Node root)
 {
  
  if(root==null)
  {
  return;
  }
  
  System.out.print(root.data+",");
  preOrder(root.left);
  preOrder(root.right);
  
  }
 public void postOrder(Node root)
 {
  
  if(root==null)
  {
  return;
  }
  
  postOrder(root.left);
  
  postOrder(root.right);
  System.out.print(root.data+",");
  }

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;}