21. Is a non-linear abstract data type with a hierarchy-based structure.

(a)  

22. refers to the sequence of nodes along the edges of tree, starting from specific nodes and leading to another node within a tree.

(a)  

23. the number of edges on the longest path from that node to any leaf in its subtree.

(a)  

24. are values stored in the nodes of a tree that help in identifying and accessing data.

(a)  

25. is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child.

(a)  

26. Refers to the process of visiting each node in the tree in a specific order.

(a)  

27. Is the node that is the furthest from the root. It is typically the node that appears at the last level of the tree, and if there are multiple nodes at that level, the deepest node is the one that is farthest to the right (in the case of a level-order traversal).

(a)  

28. Is a special type of binary tree where insertion takes place level by level and from left to right at each level.

(a)  

29. All levels are fully filled except possibly the last, which is filled from left to right.

(a)  

30. Is a special kind of data structure used in computer science to organize and manage data in a way that makes it easy to search for, add, or remove items. Let’s break this down in simple terms.

(a)