题解 | #二叉搜索树与双向链表#

/* function TreeNode(x) {
    this.val = x;
    this.left = null;
    this.right = null;
} */
function Convert(pRootOfTree)
{
    let head = null
    let p = null
    function traversal(root) {
        if(root === null) return
        traversal(root.left)
        if(root.left === null && head === null) {
            head = p = root
        } else {
          p.right = root
          root.left = p
          p = root           
        }
        traversal(root.right)
    }
    traversal(pRootOfTree)
    return head
}


module.exports = {
    Convert : Convert
};