COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Tree
|
|
|
Stack
|
|
|
List
|
|
|
Vector
|
Detailed explanation-1: -A graph without cycles is called an acyclic graph.
Detailed explanation-2: -A connected acyclic graph is called a tree. In other words, a connected graph with no cycles is called a tree. The edges of a tree are known as branches. Elements of trees are called their nodes.
Detailed explanation-3: -A tree is a connected undirected graph with no simple circuits. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices. A (not-necessarily-connected) undirected graph without simple circuits is called a forest.
Detailed explanation-4: -In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph.