Cop 3530 Exam 1 (52 Q&a)

BST Successor {Ans: Leftmost value in right subtree}AVL tree {Ans: Height balanced BST, each node has balance factor (-1, 0, 1)}Complete Binary Tree {Ans: Perfect binary tree through level (n - 1), leaf nodes may or may not be perfect, fill-in starting at left side}Right-Right case rotation {Ans: Left rotation (parent -2, child -1)}B-tree insertion algorithm {Ans: Add key like in binary tree If this causes node to have > l keys: Split node, middle key moves up, other keys become stand-alone nodes Repeat if necessary}3 Properties of trees {Ans: 1 root, each node has only 1 parent, no cycles}