CS 1332 PLUS 9/15/26

12345678910
Across
  1. 2. the ____ property of a BST is that its left child is less than its parent and its parent is less than its right child
  2. 5. data structure similar to a degenerate tree
  3. 7. traversal which uses a queue
  4. 8. recurse left, print, recurse right
  5. 9. recurse left, recurse right, print
  6. 10. each parent node has 0 or 2 children
Down
  1. 1. print, recurse left, recurse right
  2. 3. tree property which ensures O(logn) time complexities
  3. 4. nodes have maximum 2 children
  4. 6. all levels are fully filled except possibly the last, which is filled from left to right