1/5
2
			6
3
	4

Across

1. A structure in which the key in each node is greater than all keys in its left subtree and smaller than all keys in its right subtree.

2. A graph traversal algorithm that explores as far as possible along each branch before backtracking.

3. A tree traversal algorithm that visits the left subtree first, then the root node, and finally the right subtree.

4. A tree traversal algorithm that visits the left subtree first, then the right subtree, and finally the root node.

Down

5. A graph traversal algorithm that explores all the vertices of a graph in breadth-first order, i.e., visiting all the vertices at the same 'level' before moving on to the next 'level'.

6. A tree traversal algorithm that visits the root node first, then recursively visits the left subtree and finally the right subtree.

🖶