Intro to Data Structure

12345678910
Across
  1. 1. A data structure that consists of a collection of nodes (vertices) connected by edges
  2. 4. In this DS, all insertion and deletion are permitted at only one end of the list.
  3. 7. Method of arranging and keeping data in the memory or storage system of a computer
  4. 9. Type of data structure where elements are arranged in one dimension
  5. 10. Data structure where elements are linked using pointers.
Down
  1. 2. These are the basic data types used in Java programming such as integer, floating-point (real numbers), character and Boolean data types.
  2. 3. DS that are represented by a pointer to the topmost node in the tree. If the tree is empty, then the value of root is NULL.
  3. 5. It is a collection of data items stored at contiguous memory locations.
  4. 6. DS that items are inserted at one end and deleted from the other end
  5. 8. The methods for solving problems, which could be implemented in programming.