Data structure

2. informal language that help programmers develop algorithms
4. binary tree which is filled level by level.
6. Sorting technique with comparison by gap
8. static data structure
9. Technique of function calling itself
10. allocates memory as per requirement.
12. 2 Dimensional array
16. let S1 and S2 be two strings. Then __________ of S1 and S2 is denoted by S1//S2

1. A in ADT stands for ______
3. A pointer of any type that is assigned the constant NULL.
5. lower bound asymptotic notation
6. Strategy to solve 4 queens problem
7. matrix with more number of zero elements
11. sequence of zero or more characters
13. has data member and data functions
14. Unused memory allocated to the program and available to be assigned during its execution.
15. unordered collection of key-value pairs