Splay trees use AVL rotation by taking nodes that not have been accessed and move them toward the leaves.
What is a splay tree and what is the act of splaying?
A splay tree is a self-adjusting binary search tree. The act of splaying is that after a node is accessed, it is moved up in the tree toward the root with AVL rotations.
none of the above
What is the Big O for average case of Reterieval for Splay trees?
log(N)
O(N^2)
What is the benefit of using splay trees?
it allows easier access to recently added values.
Splaying is used for balancing binary search trees.
What is the worst case to search a Splay tree?
A.n
B.amortized O(log n)
C.n^2
D.none of these
How are splay trees different from AVL trees?
Splay trees splay the node visited all the way to the root to make them more easily accessed.
A splay tree is a type of balanced binary search tree.
what do you trying to splay a node with the root(zig)?
A) Avl single rotation
B) Avl double rotation
Which of the following is a disadvantage of a splay tree?
a) Recently accessed items are at the bottom of the tree
b) Implementation is very complex
c) Splay trees are not very efficient
d) The tree height can potentially be n
What is a binary search tree with the additional property that recently accessed elements are quick to access again called?
A) B-Tree
B) Spray Tree
C) AVL Tree
D) Splay Tree
What algorithm do you need to use to create a minimum spanning tree?
Prim’s Algorithm
What is a splay tree?
A. A tree with no leaves
B. A tree with two root nodes
C. A self-adjusting binary search tree
D. An empty tree
A) A self-adjusting binary search tree.
B) A tree that spreads out
C) there is no such thing
What is a condition for a zig-zag step?
A. X is the right child of P and P is the right child of G
B. X is the left child of P and P is the left child of G
C. X is the left child of P and P is the right child of G
D. zig-zag is done when P is the root (therefore there is no G)
What are splay trees?
A. self-adjusting binary sort trees
B. self-adjusting binary search trees
C. self-adjusting binary splay trees
D. non self-adjusting binary sort trees
When dealing with splay trees the condition for the Zig-Zag step is when X is the left child of P, and P is the right child of G, or When X si the right child of P and P is the left child of G.
In average case, what is the efficiency of Deletion of an AVL tree?
A. logn
B. nlogn
C. n
D. n2
Splay trees are NOT self adjusting Binary Search Trees.
What is splaying?
Moving the last accessed node in a tree to the root with AVL rotations.
