Data Structure

12345678910
Across
  1. 2. , reverse polish notation also known as.
  2. 4. , which type of notation can be used to measure the complexity of algorithm.
  3. 5. , I am also known as deck.
  4. 9. , A function or method who has the ability of calling itself to solve the problem
  5. 10. , A node that does not have any child node is called_____.
Down
  1. 1. , A graph in which all vertices have equal degree is known as.
  2. 3. , table and matrix array also called as _____dimensional array
  3. 6. , which type of search can be applied only in sorted array.
  4. 7. , I am also known as polish notation.
  5. 8. , An important factor to find the complexity of the algorithm.