Finding maximum element in binary tree

FindMaxInBinaryTree.java

public class FindMaxInBinaryTree {
  
  // find max element in binary tree recursively
  public int findMax(BinaryTreeNode root) {
    int root_val, left, regith, max = 0;
    if(root != null) {
      root_val = root.getData();
      left = findMax(root.getLeft());
      right = findMax(root.getRight());
      // find the largest of the three values.
      if(left > right)
        max = left;
      else
        max = right;
      if(root_val > max)
        max = root_val;
    }
    return max;
  }
  
  // find max element in binary tree non-recursively using level order traversal
  public int findMaxUsingLevelOrder(BinaryTreeNode root) {
    BinaryTreeNode temp;
    int max = 0;
    LLQueue<BinaryTreeNode> q = new LLQueue<BinaryTreeNode>();
    q.enqueue(root);
    while(!q.isEmpty()) {
      temp = q.dequeue();
      //largest of the three values
      if(max < temp.getData())
        max = temp.getData();
      if(temp.getLeft())
        q.enqueue(temp.getLeft());
      if(temp.getRight())
        q.enqueue(temp.getRight());
    }
    q.deleteQueue();
    return max;
  }
}