feat: add ts solution to lc problem: No.0116

No.0116.Populating Next Right Pointers in Each Node

Author: YangFong

solution/0100-0199/0116.Populating Next Right Pointers in Each Node/README.md

@@ -195,6 +195,42 @@ public:
 };
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * Definition for Node.
+ * class Node {
+ *     val: number
+ *     left: Node | null
+ *     right: Node | null
+ *     next: Node | null
+ *     constructor(val?: number, left?: Node, right?: Node, next?: Node) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+function connect(root: Node | null): Node | null {
+    if (root == null) {
+        return root;
+    }
+    const { left, right } = root;
+    if (left != null) {
+        left.next = right;
+    }
+    if (right != null && root.next != null) {
+        root.right.next = root.next.left;
+    }
+    connect(root.left);
+    connect(root.right);
+    return root;
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0116.Populating Next Right Pointers in Each Node/README_EN.md

@@ -197,6 +197,42 @@ public:
 };
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * Definition for Node.
+ * class Node {
+ *     val: number
+ *     left: Node | null
+ *     right: Node | null
+ *     next: Node | null
+ *     constructor(val?: number, left?: Node, right?: Node, next?: Node) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+function connect(root: Node | null): Node | null {
+    if (root == null) {
+        return root;
+    }
+    const { left, right } = root;
+    if (left != null) {
+        left.next = right;
+    }
+    if (right != null && root.next != null) {
+        root.right.next = root.next.left;
+    }
+    connect(root.left);
+    connect(root.right);
+    return root;
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0116.Populating Next Right Pointers in Each Node/Solution.ts

@@ -0,0 +1,31 @@
+/**
+ * Definition for Node.
+ * class Node {
+ *     val: number
+ *     left: Node | null
+ *     right: Node | null
+ *     next: Node | null
+ *     constructor(val?: number, left?: Node, right?: Node, next?: Node) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+function connect(root: Node | null): Node | null {
+    if (root == null) {
+        return root;
+    }
+    const { left, right } = root;
+    if (left != null) {
+        left.next = right;
+    }
+    if (right != null && root.next != null) {
+        root.right.next = root.next.left;
+    }
+    connect(root.left);
+    connect(root.right);
+    return root;
+}