DATA STRUCTURES int IsIn Type x); int Insert Type &x, int i) int Remove( type &x; int Next( type &x); int Prior( type &x); int /sEmpty(freturn last ==-1 int IsFullofreturn last = MaxSize-1 pe Get (int y tiC return l ‖i>last?N 0‖i data } Department of Computer Science Technology, Nanjing University fallDepartment of Computer Science & Technology, Nanjing University fall DATA STRUCTURES int IsIn ( Type & x ); int Insert ( Type & x, int i ); int Remove ( Type & x ); int Next ( Type & x ) ; int Prior ( Type & x ) ; int IsEmpty ( ) { return last ==-1; } int IsFull ( ) { return last == MaxSize-1;} Type Get ( int i ) { return i < 0 || i > last？NULL : data[i]; } }