Tree Traversal Implementation

Tree Traversal Implementation:

public class Node {

public int data;

public Node leftNode;

public Node rightNode;

Node(int Data){

this.data=Data;

this.leftNode=null;

this.rightNode=null;

}

}

public class Traversal {

public void inOrder(Node n) {

if(n==null) return;

inOrder(n.leftNode);

System.out.println(n.data);

inOrder(n.rightNode);

}

public void preOrder(Node n) {

if(n==null) return;

System.out.println(n.data);

preOrder(n.leftNode);

preOrder(n.rightNode);

}

public void postOrder(Node n) {

if(n==null) return;

postOrder(n.leftNode);

postOrder(n.rightNode);

System.out.println(n.data);

}

}

public class main {

public static void main(String s[]) {

Node n1= new Node(5);

Node n2= new Node(3);

Node n3= new Node(2);

Node n4= new Node(8);

Node n5= new Node(7);

n1.leftNode=n2;

n2.leftNode=n3;

n1.rightNode=n4;

n4.leftNode=n5;

Traversal t=new Traversal();

t.inOrder(n1);

System.out.println("************");

t.preOrder(n1);

System.out.println("************");

t.postOrder(n1);

}

}

OutPut:

2

3

5

7

8

************

5

3

2

8

7

************

2

3

7

8

5

<script async src="//pagead2.googlesyndication.com/pagead/js/adsbygoogle.js"></script>
<!-- randomknowledgeshare_ads_AdSense1_ -->
<ins class="adsbygoogle"
     style="display:block"
     data-ad-client="ca-pub-7425797582945891"
     data-ad-slot="7203573961"
     data-ad-format="auto"></ins>
<script>
(adsbygoogle = window.adsbygoogle || []).push({});
</script>