Across: |
| 4. | ENQUEUE MEANS | | 6. | NODE WITH NO CHILDREN | | 8. | NUMBER OF ARCS INCIDENT ON A VERTEX IN A GRAPH | | 10. | NUMBER OF NODES FROM LEEAF NODE TO THE PARENT NODE | | 11. | LINK CONNECTING TWO NODES IN A GRAPH | | 15. | TREE WHERE LEFT IS LESSER THAN ROOT AND RIGHT GREATER THAN ROOT | | 16. | INSERTION INTO STACK |
|
Down: |
| 1. | STACK PRINCIPLE | | 2. | DELETION OPERATION IN STACK | | 3. | NON-LINEAR DATA STRUCTURE WHICH DOES NOT ALLOW REPETITION OF ELEMENTS | | 5. | NODES WITH SAME PARENT | | 7. | ADT THAT FOLLOWS FIFO | | 9. | EVERY NODE HAS 2 CHILD ON SAME LEVEL | | 12. | TREE WITH MAXIMUM OF TWO CHILDRENS | | 13. | DATASTRUCTURE USED FOR AIRLINE ROUTING | | 14. | ADT THAT FOLLOWS LIFO |
|