二叉查找树的后继

如果是先序排列的话

Tree-Successor(x){
  if(left(x) != null)
        return Tree-MiniMun(left(x));
  if(right(x) != null) {
       return Tree-MaxMun(right(x));  
  }
  y = p[x];
  while(y != null && x == right(y)){
       x = y;
       y = p[y];
  }
  if(y  == null){
    return null;
  }
  return right(y);
}