剑指offer-二叉树的下一个结点

 public TreeLinkNode GetNext(TreeLinkNode pNode)
    {//树 my
        if(null==pNode){
            return null;
        }
        TreeLinkNode cur = pNode.right;
        if(cur!=null){
            while(cur.left!=null){
                cur = cur.left;
            }
            return cur;
        }
        
        TreeLinkNode pre = pNode.next;
        cur = pNode;
        while(null!=pre){
            if(pre.right!=cur){
                return pre;
            }
            else{
                cur = pre;
                pre = pre.next;
                
            }
        }
        return null;
    }