yo

123456789101112131415
Across
  1. 4. It’s a type of matrix where majority of elements are 0(zero)
  2. 8. The number of vertexes starting from a vertex is known as ______ of a vertex
  3. 9. Predefined data type
  4. 10. Data of different types can be stored
  5. 12. A condition where there's no memory space left
  6. 14. Think of a heap of plates, which type of data structure does it remind you of ?
  7. 15. A data structure which is designed to use a special function called hash
Down
  1. 1. Also known as in-place comparison sort
  2. 2. repetitive computations
  3. 3. where insertion and deletion can be done by both from the beginning and the end
  4. 5. A term also known as reverse polish notation
  5. 6. A search method where an element can be found only in a sorted list
  6. 7. Insertion of node a into free storage list
  7. 11. A rank structure ( from most to least)
  8. 13. One of the application of binary tree