Across
- 2. Hierarchical data structure with nodes
- 5. Remove item from the front of a queue
- 8. Operators come after operands
- 10. sort Divide-and-conquer sorting algorithm
- 11. Function calling itself to solve subproblems
- 14. FIFO structure used in scheduling
- 17. Symbol representing an operation (+, -, *, /)
- 19. Data not arranged in any order
Down
- 1. Determines which operator is evaluated first
- 3. sort Builds the sorted list one element at a time
- 4. sort Repeatedly swaps adjacent unsorted elements
- 6. A combination of values and operators
- 7. sort Uses partitioning around a pivot
- 9. Visiting nodes in a specific order
- 12. sort Equal elements keep original order
- 13. A value used in an expression
- 15. Add item to the back of a queue
- 16. LIFO structure used for postfix evaluation
- 18. Element used to split data in quick sort
- 20. Process of computing expression output