/* function TreeNode(x) {
    this.val = x;
    this.left = null;
    this.right = null;
} */
function Print(r)
{
    if(r === null)   
    return [];
  var q = [];
  var index = 0;
  var res = [];
  res.push([])
  q.push(r);
  q.push(null);
  while(q.length !== 0){
    var cur = q.shift();
    if(cur !== null){
      res[index].push(cur.val);
      if(cur.left !== null)
        q.push(cur.left);
      if(cur.right !== null)
        q.push(cur.right);
    }else{
            if(q.length !== 0){
        res.push([]);
        index++;
                q.push(null);
            }
    }
  }
  return res;
}