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