Topic 5

Edit Answers
12345678910111213141516171819202122
Across
  1. 2. to describe a function that calls itself
  2. 4. can vary in size
  3. 9. recursive data structure
  4. 13. an array of arrays
  5. 15. nothing to see here
  6. 16. remove from stack
  7. 17. remove from queue
  8. 18. a data structure that could be used when printing a document
  9. 19. when hit, recursion stops
  10. 21. a node with no children
  11. 22. a series of connected nodes
Down
  1. 1. a technique required for traversing a 2D array
  2. 3. in a binary tree, each node points to zero-two of them
  3. 4. contains a reference to both the next and previous
  4. 5. modelled with a 2D array
  5. 6. traverse a tree by left subtree, right subtree, root
  6. 7. cannot vary in size
  7. 8. every node has at least one of these
  8. 10. an efficient modification to a queue
  9. 11. a way to traverse a tree that will output the node values in ascending order
  10. 12. an example of a recursive algorithm
  11. 14. something linked lists don't provide; a benefit of arrays
  12. 20. last in, first out