Data structure--stack based on bidirectional linked list (Super simple version)

1  Packagecn.it.struct;2 3  Public classMystack<t> {4     Private intTop=-1;5     6     PrivateNode<t>Current ;7     8     9     Private classNode<t>{Ten         PrivateT data; One          A         PrivateNode<t>Next; -          -         PrivateNode<t>Pre; the  -     } -      -     //Initialize +      PublicMystack () { -top =-1; +Current =NewNode<t>(); A     } at      -     //Pressure Stack -      Public Booleanpush (T data) { -node<t> node =NewNode<t>(); -Node.data =data; -Current.next =node; inCurrent =Node.pre; -Current =node; totop++; +         return false; -     } the      *     //out Stack $      PublicT Poll () {Panax NotoginsengT data =Current.data; -Current =Current.pre; thetop--; +         returndata; A     } the}

Data structure--stack based on bidirectional linked list (Super simple version)