Data Structure and Algorithms

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