Junior — Middle
What is the data structure where there is a unique connecting path between vertices, forming a hierarchical organization?
sobes.tech AI
Answer from AI
A data structure in which there is a unique connecting path between any two vertices, forming a hierarchical organization, is called a tree.
A tree is a connected acyclic graph where one vertex is considered the root, and the others are its descendants. There are no cycles in a tree, and there is exactly one path between any pair of vertices.
An example of using a tree is a file system, where folders and files are organized hierarchically.