按值查找:寻找x的后继 int Next Seqlist &l, listData x)i int i=Find(x) if (i>0&& i< Llength )return i+1 else return -1; 寻找x的前驱 int Next( Seqlist &l, ListData)t int i= Find(x) if (i>0&& i< Llength )return i-1 else return -1▪ 按值查找：寻找x的后继 int Next ( SeqList &L, ListData x ) { int i = Find(x); if ( i >0 && i < L.length ) return i+1; else return -1; } ▪ 寻找x的前驱 int Next ( SeqList &L, ListData x ) { int i = Find(x); if ( i >0 && i < L.length ) return i-1; else return -1; }