Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.LinkedList;
- import java.util.Queue;
- public class Main1 {
- public void levelOrderQueue(Node root) {
- Queue<Node> q = new LinkedList<Node>();
- if (root == null)
- return;
- q.add(root);
- while (!q.isEmpty()) {
- Node n = (Node) q.remove();
- System.out.print(" " + n.data);
- if (n.left != null)
- q.add(n.left);
- if (n.right != null)
- q.add(n.right);
- }
- }
- public static void main(String[] args) throws java.lang.Exception {
- Node root = new Node(1);
- root.left = new Node(2);
- root.down = new Node(3);
- root.right = new Node(4);
- root.left.left = new Node(5);
- root.left.down = new Node(6);
- root.right.down = new Node(7);
- root.right.right = new Node(8);
- root.left.left.left = new Node(9);
- root.left.left.down = new Node(10);
- root.right.down.down = new Node(11);
- root.right.down.right = new Node(12);
- Main1 i = new Main1();
- System.out.println("Breadth First Search : ");
- i.levelOrderQueue(root);
- }
- static class Node {
- int data;
- Node left;
- Node right;
- Node down;
- public Node(int data) {
- this.data = data;
- this.left = null;
- this.right = null;
- this.down = null;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
