Level Order Traversal using Queue - Java

public class LevelOrderUsingQueue {

public static void main(String[] args) {
Node node = new Node(40);
node.left = new Node(35);
node.right = new Node(50);
node.left.left = new Node(30);
node.left.right = new Node (38);
node.left.left.right = new Node(33);
node.left.left.left = new Node(28);
levelOrderWithQueue(node);
}


public static void levelOrderWithQueue(Node root){
Node tempNode;
Node[] queue = new Node[20];
int front = 0, rear = 0;

tempNode = root;
while(tempNode != null){
System.out.println(tempNode.value);

if(tempNode.left != null){
queue[rear] = tempNode.left;
rear++;
}

if(tempNode.right != null){
queue[rear] = tempNode.right;
rear++;
}

front++;
tempNode = queue[front - 1];
}
}
}