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

Insertion Sort in JAVA

What is insertion sort?

It is a sorting technique that is based on the partitioning of array into two parts like selection sort, sorted and unsorted.

The process is:-

compare adjacent elements.
if(left > right)
Swap the element
{
check for sorted array whether it is still in sort manner(put j=i and loop in until j is not equal to zero)
- No
check for if(right<left)
swap
do it until at the end of position.
}

Implementation:-

Underline eleemnts are part of sorted arrayinside main array loop 142710333519424 (141027333519424 (here sorted array is distorted hence sorting has been done inside the loop) inside sorted array loop101427333519424 inside main array loop101427333519424 inside main array loop 101427333519424 inside main array loop101427333519424 inside sorted array loop 101427193335424 inside sorted array loop 101419273335424 inside main array loop 101419273335424 inside main array loop 101419273335424 inside sorted array loop101419273343542 inside…