• A A tree in which each node has at most one child
  • B A tree in which each node has exactly two children
  • C A self-balancing binary search tree in which each node is colored either red or black
  • D A self-balancing binary search tree