Final Exam Flashcards
What is a linked list
A linked chain of dynamically allocated data structures
Data structures that contain pointers to The same structure is called
Self – referential will datatypes
Term for the “Next” pointer is
Successor pointer
The process of beginning at the head of a listing going through the entire list while doing some processing at each node is called
Traversing the list
what signifies the end of a linked list
the last “next” pointer is pointing to NULL
basic linked list operations (linked list “Big 4”)
adding elements, removing elements, traversing the list, and destroying the list
one condition that MUST be checked before performing operations on a linked list
is the list empty (i.e. does head point to NULL)
a data structure that stores and retrieves items FILO/LIFO
stack
a data structure that stores and retrieves items FIFO/LILO
queue
to insert an element at rear of queue
enqueue
to remove an element from front of a queue
dequeue
when used for searching, binary trees are called
BSTs Binary Search Trees
even if a function is void, you can still
return;
