100. 相同的树 about javascript-leetcode HOT 1 OPEN

var isSameTree = function(p, q) {
  if(!p && !q){
    return true
  }
  let queue = [p, q];
  while（queue.length){
    let root1 = queue.shift();
    let root2 = queue.shift();

    if(!root1 && !root2) {
      continue;
    }

    if(root1 && root2 && root1.val  !==  root2.val){
      return false
    }
    
    if(!root1 || !root2){
      return false
    }
	
    queue.push(root1.left, root2.left);
    queue.push(root1.right, root2.right);
  }
  return true;
}