3.2k views

If node A has three siblings and B is parent of A, what is the degree of A?

1. 0
2. 3
3. 4
4. 5
in DS | 3.2k views

Now coming to question if node $A$ has three siblings and $B$ is the parent of $A$. This is the only information given.

It is not given whether node $A$ is an internal node or leaf node and also total number of node in the graph is not given.

So given information is not sufficient to decide what should be the degree of node $A$.

So the degree of node $A$ can be any of the above.

by Boss (38.3k points)
selected by
+2
mahol hai sir. :)
0
is it mentioned anywhere that that graph has only 4 nodes ?? if not they why are u assuming A as leaf node ??
0
No other info is given other than <If node A has three siblings and B is parent of A>.we can not  add extra information by our own assumption.
+1
i am not adding anything . question is ambiguous i guess. i can't say answer is 0 or 4 or 3
0
Answer should be 4, because if we consider node A at leaf level , anyhow degree will be 1(consider undirected graph) but no option with degree 1. Now (consider A no-leaf node), so we can consider it strict 4-ary tree then every node have 0 or 4 childs, then we can say that  degree of A=4
0
If A has 4 children den degree will be 5 not 4 bcz of link connnected to B...
+5
I don't think one can solve this with the given data - they missed copying the remaining part of question. Should be Mark to All.
0
yes you are right shikha,
0
now ya i also think same Arjun sir(Missing Data)
0
Since B is parent of A, the degree of A can be anything but 0 (zero). So I guess the question is printed wrong and it must be asking "Which can't be degree of node A'

A/c to given condition B is parent of A and A has 3 Siblings.Degree of A would be 0

Without any assumptions Answer is matching with option A

by Boss (45.1k points)
0
Degree of A is 1 in ur example, not 0
by Boss (45.1k points)

Node "A" has 3 siblings and B is parent of A.

A is child of B.

There is no children for A

So, A must me leaf node

Degree of leaf node is 0

by Active (3.8k points)
it will be zero offcourse
by (193 points)

In tree the number of subtrees of a node is called the degree of the node.So degree of leaf node is 0.

In graph degree of a node is the total no node connected with it.(If it is graph then ans is 1)

ans:0(a)

by (419 points)
Degree is number of nodes adjacent to a given node. Since B is parent of A, the degree of A can be anything but 0 (zero). So I guess the question is printed wrong and it must be asking "Which can't be degree of node A'. According to this answer should be option A
by Active (2.9k points)

1
2