/*function TreeLinkNode(x){
    this.val = x;
    this.left = null;
    this.right = null;
    this.next = null;
}*/
function GetNext(pNode)
{
    // write code here
    let root = pNode
    while(root.next){
        root = root.next
    }
    let arr = []
    inorder(root,arr)
    for(let i = 0;i<arr.length;i++){
        if(arr[i]==pNode) return arr[i+1]
    }
}
function inorder(root,arr){
    if(root.left) inorder(root.left,arr)
    if(root)arr.push(root)
    if(root.right) inorder(root.right,arr)
}