feat: add go solution to lc problem: No.0116 (doocs#843)

No.0116.Populating Next Right Pointers in Each Node

Author: ifmagic

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

@@ -276,6 +276,38 @@ function connect(root: Node | null): Node | null {
 }
 ```
 
+### **Go**
+
+```go
+/**
+ * Definition for a Node.
+ * type Node struct {
+ *     Val int
+ *     Left *Node
+ *     Right *Node
+ *     Next *Node
+ * }
+ */
+
+func connect(root *Node) *Node {
+	if root == nil {
+		return root
+	}
+	traversal(root.Left, root.Right)
+	return root
+}
+
+func traversal(left, right *Node) {
+	if left == nil || right == nil {
+		return
+	}
+	left.Next = right
+	traversal(left.Left, left.Right)
+	traversal(left.Right, right.Left)
+	traversal(right.Left, right.Right)
+}
+```
+
 ### **...**
 
 ```

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

@@ -260,6 +260,38 @@ function connect(root: Node | null): Node | null {
 }
 ```
 
+### **Go**
+
+```go
+/**
+ * Definition for a Node.
+ * type Node struct {
+ *     Val int
+ *     Left *Node
+ *     Right *Node
+ *     Next *Node
+ * }
+ */
+
+func connect(root *Node) *Node {
+	if root == nil {
+		return root
+	}
+	traversal(root.Left, root.Right)
+	return root
+}
+
+func traversal(left, right *Node) {
+	if left == nil || right == nil {
+		return
+	}
+	left.Next = right
+	traversal(left.Left, left.Right)
+	traversal(left.Right, right.Left)
+	traversal(right.Left, right.Right)
+}
+```
+
 ### **...**
 
 ```

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

@@ -0,0 +1,27 @@
+/**
+ * Definition for a Node.
+ * type Node struct {
+ *     Val int
+ *     Left *Node
+ *     Right *Node
+ *     Next *Node
+ * }
+ */
+
+func connect(root *Node) *Node {
+	if root == nil {
+		return root
+	}
+	traversal(root.Left, root.Right)
+	return root
+}
+
+func traversal(left, right *Node) {
+	if left == nil || right == nil {
+		return
+	}
+	left.Next = right
+	traversal(left.Left, left.Right)
+	traversal(left.Right, right.Left)
+	traversal(right.Left, right.Right)
+}