leetcode-go/medium/116.js

/**
 * Definition for binary tree with next pointer.
 * function TreeLinkNode(val) {
 *     this.val = val;
 *     this.left = this.right = this.next = null;
 * }
 */

function TreeLinkNode(val) {
    this.val = val
    this.left = this.right = this.next = null
}

/**
 * @param {TreeLinkNode} root
 * @return {void} Do not return anything, modify tree in-place instead.
 */
var connect = function(root) {
    
}

function __main__() {
    
}

__main__()