Statements (51)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:architecture
|
| gptkbp:advantage |
dynamic memory allocation
no random access extra memory for pointers |
| gptkbp:canBe |
circular
doubly singly |
| gptkbp:complexityDeletion |
O(1) at head
|
| gptkbp:complexityInsertion |
O(1) at head
|
| gptkbp:complexitySearch |
O(n)
|
| gptkbp:firstDescribed |
gptkb:Allen_Newell
1955 |
| gptkbp:firstNodeCalled |
head
|
| gptkbp:hasNode |
data
pointer |
| gptkbp:hasType |
doubly linked list
circular linked list singly linked list |
| https://www.w3.org/2000/01/rdf-schema#label |
LinkedList
|
| gptkbp:implementedIn |
gptkb:Java
gptkb:Python gptkb:C++ |
| gptkbp:lastNodeCalled |
tail
|
| gptkbp:notableFor |
gptkb:Java_Collections_Framework
gptkb:C++_STL gptkb:Python_collections_module |
| gptkbp:numberOfLocations |
nodes
|
| gptkbp:operator |
search
deletion insertion traversal |
| gptkbp:relatedTo |
gptkb:Queue
Stack ArrayList |
| gptkbp:usedFor |
memory management
implementing graphs implementing queues implementing stacks |
| gptkbp:usedIn |
gptkb:LISP
computer science operating systems compiler design functional programming symbolic computation database management systems memory allocation adjacency list representation of graphs network packet management undo functionality in applications |
| gptkbp:bfsParent |
gptkb:java.util_package
|
| gptkbp:bfsLayer |
5
|