7,350 views
9 votes
9 votes

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

7 Answers

Best answer
12 votes
12 votes

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.

selected by
8 votes
8 votes

Answer : 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

2 votes
2 votes

I think Answer is A

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

    

Answer:

Related questions

9 votes
9 votes
3 answers
1
go_editor asked Jun 23, 2016
21,466 views
The average depth of a binary search tree is$O(n^{0.5})$$O(n)$$O(\log n)$$O(n \log n)$
4 votes
4 votes
4 answers
2
Isha Gupta asked Jun 15, 2016
7,467 views
The in-order traversal of a tree resulted in FBGADCE. Then the pre-order traversal of that tree would result inFGBDECAABFGCDEBFGCDEAAFGBDEC
10 votes
10 votes
3 answers
3
ajit asked Oct 1, 2015
10,207 views
How many distinct binary search trees can be created out of $4$ distinct keys?$5$$14$$24$$35$