CIT 594 Final Exam
Save
Get a taste for our practice questions
Learn
Studied 7 terms
Nice work, you're crushing it
Continue studying in Learn
Terms in this set (17)
, A set interface that uses a tree
Tree Set
for storage
what is the time O(n)
complexity of a
single for loop?
What is the time O(n)
complexity of
linked list's get
operation?
How is the hashcode % number_of_buckets
bucket number
calculated for a
hash set ?
a self-balancing sorted binary
AVL Tree tree, in which the heights of
subtrees differ by at most 1.
a complete binary tree in which
the value in each internal node
is greater than or equal to the
Max Heap
values of the children in those
nodes(Note* NOT the SUM, just
each individual value)
Save
Get a taste for our practice questions
Learn
Studied 7 terms
Nice work, you're crushing it
Continue studying in Learn
Terms in this set (17)
, A set interface that uses a tree
Tree Set
for storage
what is the time O(n)
complexity of a
single for loop?
What is the time O(n)
complexity of
linked list's get
operation?
How is the hashcode % number_of_buckets
bucket number
calculated for a
hash set ?
a self-balancing sorted binary
AVL Tree tree, in which the heights of
subtrees differ by at most 1.
a complete binary tree in which
the value in each internal node
is greater than or equal to the
Max Heap
values of the children in those
nodes(Note* NOT the SUM, just
each individual value)
