| 1/13 | 16 | 19 | |||||||||||||||||||||||
| 2 | |||||||||||||||||||||||||
| 3/4 | |||||||||||||||||||||||||
| 5 | |||||||||||||||||||||||||
| 6 | 18 | ||||||||||||||||||||||||
| 7 | 14 | ||||||||||||||||||||||||
| 8 | |||||||||||||||||||||||||
| 9 | 17 | ||||||||||||||||||||||||
| 15 | |||||||||||||||||||||||||
| 10 | |||||||||||||||||||||||||
| 11 | |||||||||||||||||||||||||
| 12 | |||||||||||||||||||||||||
1. 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'.
2. A tree traversal algorithm that visits the left subtree first, then the root node, and finally the right subtree.
3. A method where the nodes are visited in the order: root, left subtree, right subtree.
4. A tree traversal algorithm that visits the root node first, then recursively visits the left subtree and finally the right subtree.
5. Involves adding a new node while maintaining the tree's properties by placing the new node in the correct position based on its value.
6. A node that has one or more children. Every node, except the root, has one parent.
7. A portion of the tree that consists of a node and all its descendants.
8. A tree traversal algorithm that visits the left subtree first, then the right subtree, and finally the root node.
9. A node that is a direct descendant of another node. A node can have a left child and a right child.
10. A tree where all levels are fully filled except possibly for the last level, which is filled from left to right.
11. Used in machine learning for classification tasks.
12. A method of visiting nodes in a tree data structure by exploring all nodes at the current depth level before moving on to nodes at the next depth level.
13. A tree traversal technique that processes all sibling nodes before proceeding to their children, ensuring that nodes are visited in a level-wise manner.
14. 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.
15. Can be more complex as it requires careful consideration of the node's children, with different cases arising depending on whether the node to be deleted has zero, one, or two children.
16. A technique where the nodes are visited in the order: left subtree, root, right subtree.
17. Nodes that share the same parent.
18. A tree data structure in which each node has at most two children.
19. A graph traversal algorithm that explores as far as possible along each branch before backtracking.