suntek programming solutions
-
Updated
Sep 22, 2019 - C
suntek programming solutions
linked list implementation of stack, the nodes are maintained non-contiguously in the memory. Each node contains a pointer to its immediate successor node in the stack. Stack is said to be overflown if the space left in the memory heap is not enough to create a node.
data structures&Prog/code in java
Add a description, image, and links to the suntek topic page so that developers can more easily learn about it.
To associate your repository with the suntek topic, visit your repo's landing page and select "manage topics."