Across
- 2. Profit associated with an item in knapsack problems
- 4. A binary tree where left children are smaller, right are larger
- 6. linear data structure following the LIFO principle
- 8. connection between two nodes in a graph
- 9. A basic unit in a linked list or tree structure
- 10. The position for insertion in a queue
- 11. Last In, First Out order, characteristic of a stack
- 13. specialized tree-based data structure used for priority queues
- 15. A data structure storing elements in contiguous memory locations
- 17. Adding an element to the rear of a queue
- 19. The topmost node in a tree data structure
- 21. A non-linear data structure with vertices and edges
- 22. linear data structure following the FIFO principle
- 23. node directly below another in a tree
- 25. The position for removal in a queue
- 26. Operation to remove an element from the top of a stack
- 28. property of items in knapsack problems
Down
- 1. self-balancing binary search tree
- 3. Nodes connected by an edge in a graph
- 5. Process of visiting all nodes in a tree or graph
- 7. Removing an element from the front of a queue
- 12. A tree traversal method: Left, Root, Right
- 14. A node directly above another in a tree
- 16. Problem of maximizing value within a weight limit
- 18. Algorithm approach for fractional knapsack problems
- 20. Type of linked list with previous and next pointers
- 24. Programming paradigm used for 0/1 knapsack
- 25. First In, First Out order, characteristic of a queue
- 26. Operation to add an element to the top of a stack
- 27. Viewing the top element without removal