Use a non-recursive algorithm to search for an element in a binary tree java

Sequence traversal

You can use layer sequence traversal to solve this problem

Code

boolean searchUsingLevelOrder(BinaryTreeNode root,int data){
    
    
  BinaryTreeNode temp;
  LLQueue q = new LLQueue();
  if(root == null)
    return false;
  q.enqueue(root);
  while(q.isNotEmpty()){
    
    
    temp = q.deQueue();
    if(data == root.getData())
      return true;
    if(temp.getLeft() != null)
      q.enqueue(temp.getLeft());
    if(temp.getRight() != null)
      q.enqueue(temp.getRight());
  }
  q.deleteQueue();
  return false;
}