leetcode116 119

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

1

/
2 2
/ \ /
3 4 4 3

class Solution {
 public boolean isSymmetric(TreeNode root) {
       Queue<TreeNode> q = new LinkedList<>();
       q.add(root);
       q.add(root);
       while (!q.isEmpty()) {
           TreeNode t1 = q.poll();
           TreeNode t2 = q.poll();
           if (t1 == null && t2 == null) continue;
           if (t1 == null || t2 == null) return false;
           if (t1.val != t2.val) return false;
           q.add(t1.left);
           q.add(t2.right);
           q.add(t1.right);
           q.add(t2.left);
       }
       return true;
   }
}

leetcode116
You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:

struct Node {
  int val;
  Node *left;
  Node *right;
  Node *next;
}

Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

Initially, all next pointers are set to NULL.

Example:

```javascript
Input: {"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":null,"right":null,"val":4},"next":null,"right":{"$id":"4","left":null,"next":null,"right":null,"val":5},"val":2},"next":null,"right":{"$id":"5","left":{"$id":"6","left":null,"next":null,"right":null,"val":6},"next":null,"right":{"$id":"7","left":null,"next":null,"right":null,"val":7},"val":3},"val":1}

Output: {"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":{"$id":"4","left":null,"next":{"$id":"5","left":null,"next":{"$id":"6","left":null,"next":null,"right":null,"val":7},"right":null,"val":6},"right":null,"val":5},"right":null,"val":4},"next":{"$id":"7","left":{"$ref":"5"},"next":null,"right":{"$ref":"6"},"val":3},"right":{"$ref":"4"},"val":2},"next":null,"right":{"$ref":"7"},"val":1}

Explanation: Given the above perfect binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B.

   if(root == null) return;
    if(root.left != null)
      root.left.next = root.right;
    if(root.right != null && root.next != null)
      root.right.next = root.next.left;
    else if(root.right != null && root.next == null)
      root.right.next = root.next;
    connect(root.left);
    connect(root.right);

**

LeetCode119

**
https://leetcode.com/problems/pascals-triangle-ii/
给定一个非负索引 k，其中 k ≤ 33，返回杨辉三角的第 k 行。
在杨辉三角中，每个数是它左上方和右上方的数的和。