Print test
5 Written questions
5 Matching questions
 acyclic
 undirected
 exclusive or
 random access
 AVL tree
 a a binary Boolean function whose output is 1 if its inputs are different. Abbreviated XOR.
 b a selfbalancing sorted binary tree, in which the heights of subtrees differ by at most 1.
 c describes a data structure or device in which all accesses have the same cost, O(1).
 d describes a graph with no cycles (circular paths).
 e describes a graph in which the arcs may be followed in either direction.
5 Multiple choice questions
 describes a relation that is both injective and surjective (onetoone and onto).
 the act of comparing two values to determine which is greater according to some ordering.
 a sequence of steps along arcs in a graph.
 in a tree, a node pointed to by a parent node.
 a directed graph with no cycles.
5 True/False questions

minimum spanning tree → a tree in which each node has at most two children.

Splay tree → a selfbalancing binary tree that places recently accessed elements near the top of the tree for fast access.

tree rotation → a case where a program calls itself.

sentinel → an extra record at the start or end of a data structure such as a linked list, to simplify the processing.

topological sort → O(n*log(n)) search algorithm; inplace, not stable. Picks a pivot, reorders so lesser objects are in front of pivot, recursively sorting sublists of lesser and sublists of greater values.