FilesExpand file tree

 master

/

LevelOrderTraversalQueue.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

62 lines (52 loc) · 1.67 KB

 master

/

LevelOrderTraversalQueue.java

Copy path

Top

File metadata and controls

• Code
• Blame

62 lines (52 loc) · 1.67 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

import java.util.Queue;

import java.util.LinkedList;

/* Class to represent Tree node */

class Node {

int data;

Node left, right;

public Node(int item) {

data = item;

left = null;

right = null;

}

}

/* Class to print Level Order Traversal */

public class LevelOrderTraversalQueue {

Node root;

/* Given a binary tree. Print its nodes in level order

using array for implementing queue */

void printLevelOrder()

{

Queue<Node> queue = new LinkedList<Node>();

queue.add(root);

while (!queue.isEmpty())

{

/* poll() removes the present head.

For more information on poll() visit

http://www.tutorialspoint.com/java/util/linkedlist_poll.htm */

Node tempNode = queue.poll();

System.out.print(tempNode.data + " ");

/*Enqueue left child */

if (tempNode.left != null) {

queue.add(tempNode.left);

}

/*Enqueue right child */

if (tempNode.right != null) {

queue.add(tempNode.right);

}

}

}

public static void main(String args[])

{

/* creating a binary tree and entering

the nodes */

LevelOrderTraversalQueue tree_level = new LevelOrderTraversalQueue();

tree_level.root = new Node(1);

tree_level.root.left = new Node(2);

tree_level.root.right = new Node(3);

tree_level.root.left.left = new Node(4);

tree_level.root.left.right = new Node(5);

System.out.println("Level order traversal of binary tree is - ");

tree_level.printLevelOrder();

}

}