Data Structure and Algorithms

Edit Answers
123456789101112131415161718192021
Across
  1. 2. ______is in order traversal sequence
  2. 4. A Stack, in other words, is called a ________ list.
  3. 6. Inserting an item into the stack when a stack is not full is called ………….
  4. 7. is very useful in a situation when data have to stored and then retrieved in reverse order.
  5. 8. In ____________algorithm, a sorted array of edges is required in order to construct a minimal spanning tree.
  6. 13. ___________is a logical method of representing data in memory
  7. 15. Children of the same parent are called _________
  8. 16. Function _____ is used to reclaim dynamically allocated memory.
  9. 18. In ___________traversal, the root node is visited last.
  10. 20. A ________operator used to access structure members using pointer
  11. 21. __________Data structure used to represent hierarchical relationship between elements.
Down
  1. 1. ______is post order traversal sequence
  2. 2. A tree node that has no children is called _____ node.
  3. 3. a pile in which items are added at one end and removed from the other.
  4. 4. In _______ search start at the beginning of the list and check every element in the list.
  5. 5. Stack is ______ memory
  6. 9. _______is the process of visiting every node in a tree atleast once.
  7. 10. _____is Two dimensional arrays.
  8. 11. _______data structure used in breadth-first search of a graph.
  9. 12. the process Function calling itself is call _____ function
  10. 14. _____ is dyanamic memory
  11. 17. _____data structure use to store the homogeneous data elements
  12. 19. The first node of a tree is the _____ node.