BFS - Binary Tree

public void bfs(TreeNode root) {
    if (root == null) {
        return;
    }
        
    Queue<TreeNode> queue = new LinkedList<>();
    queue.add(root);
    
    while(!queue.isEmpty()) {
        TreeNode node = queue.remove();
        
        System.out.print(node.element + " ");
        
        if(node.left != null) {
            queue.add(node.left);
        }
        
        if(node.right != null) {
            queue.add(node.right);
        }
    }
}