COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
0
|
|
|
1
|
|
|
n
|
|
|
n-1
|
Detailed explanation-1: -The number of subtrees of a node is called the degree of the node. In a binary tree, all nodes have degree 0, 1, or 2. A node of degree zero is called a terminal node or leaf node. A non-leaf node is often called a branch node.
Detailed explanation-2: -A vertex with degree 0 is called an isolated vertex.
Detailed explanation-3: -A leaf has necessarily degree zero. The degree of a tree is the maximum degree of a node in the tree. The number of edges along the shortest path between two nodes. The level of a node is the number of edges along the unique path between it and the root node.
Detailed explanation-4: -A binary tree is a special form of tree. A tree is which the outdegree of each node is exactly two except leaf node is known as binary tree. D. Complete Binary tree A binary tree is said to be complete binary tree if all the leaf nodes are at same level.
Detailed explanation-5: -The degree of a node is the number of connections that it has to other nodes in the network. In a social network if you have 100 friends then the node that represents you has a degree of 100. Path length is simply the distance between two nodes, measured as the number of edges between them.