structure - How occur if we use linked list for stack implementation?


i new stacks. know, if there not enough space in stack , want push element stack, stack in overflow state. occur when use array based implementation of stack because have define capacity of array. if want push element exceeding capacity, overflow occur if use linked list stack implementation how stack overflow occur? in linked list need not define capacity, dynamically allocate memory nodes. please me recognize issue. in advance.

i recommend use linked list.as know there no stack overflows in linked list. that's why use data structure instead of array implementations lists, stacks. implementation of linked list lengthy( can use pre-defined libraries) , high cache usage . it's suitable holding data on dynamic sizes because has property of dynamically allocate memory nodes mentioned above.
hope helps!


Comments

Popular posts from this blog

scala - 'wrong top statement declaration' when using slick in IntelliJ -

c# - DevExpress.Wpf.Grid.InfiniteGridSizeException was unhandled -

PySide and Qt Properties: Connecting signals from Python to QML -