COMPUTER PROGRAMMING II IP1

12345678910
Across
  1. 3. Non linear data structure
  2. 4. To represent hierarchical relationship between elements, _________ data structure is suitable
  3. 6. ...... is not the operation that can be performed on queue.
  4. 9. Evaluation of arithmetic expressions is the application of __________
  5. 10. In ........, search start at the beginning of the list and check every element in the list.
Down
  1. 1. ....... is a pile in which items are added at one end and removed from the other
  2. 2. In the ....... traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
  3. 5. linear type data structure
  4. 7. Any node is the path from the root to the node is called
  5. 8. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called .....
  6. 9. Last in first out