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