CIT 594 FINAL EXAM QUESTIONS WITH CORRECT ANSWERS
AVL Tree - correct answer- a self-balancing sorted binary tree, in
which the heights of subtrees differ by at most 1.
How does a queue operate? - correct answer- -adds to the rear and
removes from the front
-It is a linked list that is first in first out
How does a stack operate? - correct answer- -think of a stack as
literally a stack of bricks but each element contains data
-It is a linked list that is last in first out
How is the bucket number calculated for a hash set ? - correct answer-
hashcode % number_of_buckets
How much time do rotations take for self balancing BST's? - correct
answer- O(1)
Max Heap - correct answer- a complete binary tree in which the
value in each internal node is greater than or equal to the values of the
children in those nodes(Note* NOT the SUM, just each individual value)
AVL Tree - correct answer- a self-balancing sorted binary tree, in
which the heights of subtrees differ by at most 1.
How does a queue operate? - correct answer- -adds to the rear and
removes from the front
-It is a linked list that is first in first out
How does a stack operate? - correct answer- -think of a stack as
literally a stack of bricks but each element contains data
-It is a linked list that is last in first out
How is the bucket number calculated for a hash set ? - correct answer-
hashcode % number_of_buckets
How much time do rotations take for self balancing BST's? - correct
answer- O(1)
Max Heap - correct answer- a complete binary tree in which the
value in each internal node is greater than or equal to the values of the
children in those nodes(Note* NOT the SUM, just each individual value)
