题解 | #二叉树的下一个结点#

/* public class TreeLinkNode { int val; TreeLinkNode left = null; TreeLinkNode right = null; TreeLinkNode next = null;

TreeLinkNode(int val) {
    this.val = val;
}

} */ public class Solution { public TreeLinkNode GetNext(TreeLinkNode pNode) { if(pNode == null){ return null; } if(pNode.right != null){ pNode = pNode.right; while(pNode.left != null){ pNode = pNode.left; } return pNode; } while(pNode.next != null){ TreeLinkNode root = pNode.next; if(root.left == pNode){ return root; } pNode = pNode.next;

    }
    return null;
}

}