{ private SinglyLinkedNode top Node = null; Data Structures Stacks The pop method willemove ihe last...

Question

{ private SinglyLinkedNode top Node = null; Data Structures Stacks The pop method willemove ihe last clenca hat was added to tle stack pubile I popo • li seack is enpty tlauw at EuptyStackException. Iuport the EmpeyStackExccption class which is in tle javautd package if lisEmpaydo Data Suructures Stacks Duta Stractures Stack d Stack undkrlow throw new ErptyStackEeptioan. • lf there are ekments. get the ckment at the end af che sack (index is topOtStack) aad decrement the indea of the tup af the stack. Set the previous tog of che Szack su aul E returOy - datai dataltopOtScack) - null; • Decrernene the index of the op n the seack and rerurn che previous cop. top(tStack, Data Structures I Stack 8 public void push(E newElement) { // create a node that holds the new element // set the next node reference of the new node to the current top Il set the top node to reference the new element public boolean isEmpty0 { i cmpty if the topNode is null return Run the tollowiag in iateractions witha viewer open on the vark object. Anvwer the follewing questions and then use the viewer co verity your answers. - What wilthe srack look likke after ievolcing rhe pash operarion public E pop0 { ii throw an exception if stack is empty /i store data from current top node (type E) Il set the top node to reference the next node in the stack Il return the stored data on String objects "ist. "and", and • What would a nop operation rerurn ar this poinr? Whar woald a second pop operation rerum? ArrayBasedStack stack - new AmayliasedStack(gk tack inllonprasetacah Enie stack puslt'isa'k stack islipryo public E peck0 { li throw an exception if stack is empty // return the data from the top node false stark pash and'k stack panht" sed'k Stack pop0 stack pop0 2nd Sack pusht"4ih", stack pop0 Submit both the ArrayBasedStack class and the LinkedStack class implementations stack pop0 stack isEmptyo "/>Extracted text: JAVA Stacks Data Scructures IStack Implementarion Create a class called ArrayBasedStack. Declare the follkawing variahles: * data references an array scoring elements in the ist mpOStack. an inr value represenring the location nf the stack Top in the array • INITIAL, (CAPACITY the defalt capaciey of the srack puhlic clans AayRasedSeack { private SinglyLinkedNode top Node = null; Data Structures Stacks The pop method willemove ihe last clenca hat was added to tle stack pubile I popo • li seack is enpty tlauw at EuptyStackException. Iuport the EmpeyStackExccption class which is in tle javautd package if lisEmpaydo Data Suructures Stacks Duta Stractures Stack d Stack undkrlow throw new ErptyStackEeptioan. • lf there are ekments. get the ckment at the end af che sack (index is topOtStack) aad decrement the indea of the tup af the stack. Set the previous tog of che Szack su aul E returOy - datai dataltopOtScack) - null; • Decrernene the index of the op n the seack and rerurn che previous cop. top(tStack, Data Structures I Stack 8 public void push(E newElement) { // create a node that holds the new element // set the next node reference of the new node to the current top Il set the top node to reference the new element public boolean isEmpty0 { i cmpty if the topNode is null return Run the tollowiag in iateractions witha viewer open on the vark object. Anvwer the follewing questions and then use the viewer co verity your answers. - What wilthe srack look likke after ievolcing rhe pash operarion public E pop0 { ii throw an exception if stack is empty /i store data from current top node (type E) Il set the top node to reference the next node in the stack Il return the stored data on String objects "ist. "and", and • What would a nop operation rerurn ar this poinr? Whar woald a second pop operation rerum? ArrayBasedStack stack - new AmayliasedStack(gk tack inllonprasetacah Enie stack puslt'isa'k stack islipryo public E peck0 { li throw an exception if stack is empty // return the data from the top node false stark pash and'k stack panht" sed'k Stack pop0 stack pop0 2nd Sack pusht"4ih", stack pop0 Submit both the ArrayBasedStack class and the LinkedStack class implementations stack pop0 stack isEmptyo

{private SinglyLinkedNode top Node = null;Data Structures StacksThe pop method willemove ihe last clenca hat was added totle stackpubile I popo• li seack is enpty tlauw at EuptyStackException....

Get Answer To This Question

Related Questions & Answers

Submit New Assignment