7,347 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

0 votes
0 votes

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)

0 votes
0 votes
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
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,203 views
How many distinct binary search trees can be created out of $4$ distinct keys?$5$$14$$24$$35$