Non-recursive search for the largest element of a binary tree java

method

Using the layer sequence traversal method, observe whether the data value is the largest when deleting a node

int findMaxUsingLevelOrder(BinaryTreeNode root){
    
    
  if(root == null){
    
    
    return -1;
  }
  BinaryTreeNode temp;
  int max = INT_MIN;
  llQueue q = new llQueue();
  q.enqueue(root);
  while(!q.isEmpty()){
    
    
    temp = q.dequeue();
    if(max<temp.getData())
      max = temp.getData();
    if(temp.getLeft()!=null)
      q.enqueue(temp.getLeft());
    if(temp.getRight() != null)
      q.enqueue(temp.getRight());
  }
  q.deleteQueue();
  return max;
}