COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
data structure similar to a graph, with no loops.
|
|
|
an object in a graph also known as a vertex
|
|
|
a join of relationship between nodes-also know as an arc
|
|
|
the starting node in a rooted tree structure from which all other nodes branch off./
|
Detailed explanation-1: -The root node is the highest node in the tree structure, and has no parent. This node is a global element and represents the entire message. It may have one or more child nodes, but can never have sibling nodes or be repeating.
Detailed explanation-2: -Decision trees have three main parts: a root node, leaf nodes and branches. The root node is the starting point of the tree, and both root and leaf nodes contain questions or criteria to be answered.
Detailed explanation-3: -The root of a tree is the start node for traversals. If the tree has a root, it is called a rooted tree. A branch is a path from the root to an end point. The end point is called a leaf.
Detailed explanation-4: -Tree topology is a type of network topology in which the nodes are arranged in the design of a tree. In tree topology, branching cable starts from the node at the head top known as the root node. The branching cable having no loops connect the root with all other nodes in hierarchical manner for communication.