Data Structures
The realization of a data type as a software component solely in terms of a set of values and a set of operations on that data type.
What is an ADT?
The time complexity for a double linked list direct access.
What is Theta 1?
The name for queue deletion.
What is dequeue?
what is 2n+2?
A tree that consists of a root and zero or more subtrees.
What is a General Tree?
A method or process that solves a problem in a finite amount of time
the upper bound characterization of the worst case performance for n as n grows large
What is Big O?
LIFO
What is a stack?
Any traversal that lists every node in the tree exactly once.
What is enumeration?
The two traverals for general trees.
What is post-order and pre-order?
A task to be performed best thought of in terms of inputs and matching outputs.
What is a problem?
Defining the mathematical boundation/framing of run-time performance or computing the running time of any operation in mathematical units of computation.
When elements have position.
What is order?
What is n(2P + D)?
List of Children
Left-Child/Right-Sibling
Dynamic Node Implementations 1 and 2
Dynamic “Left-Child/Right-Sibling
What are general tree implementations?
Instance or concrete representation of an algorithm in some programming language.
What is a program?
for(int i=0;i<100;i++)
{
for(int j=0;j<100;j=j*2)
{
//statement
}
}
What is nLog(n)?
The space comparision formula for arrays and linked lists.
x = DE/(P+E)
The number of leaves in a non-empty full binary tree is one more than the number of internal nodes.
What is the full binary tree theorem?
A tree where only a pointer to the parent is implemented.
What is a parent pointer tree?
implementation of the data item within a data structure.
Ex: Stack implemented as an array or a linked-list
What is physical form?
for(i=0;i<10;i++)
for(j=0; j<=i;j++)
//statement
What is n(n+1)/2?
or n^2 + n
create new node
new node points to curr->next
curr->next points to new node
What is linked list insertion?
The number of null pointers in a non-empty tree is one more than the number of nodes in the tree.
What is the full binary tree corollary?
A tree that has internal nodes with a fixed number of children greater than 2.
What is a K-ary?