A balanced ternary tree with 5 levels of nodes, i.e., peers. Thus, there is one root at Level 1, which has 3 children at Level 2, which each have 3 children at Level 3, which in turn each have 3 children at Level 4, which in turn each have 3 children at Level 5 – thus, there are a total of 121 nodes.
What is the minimum TTL required for any node’s Query to reach every other node?
Answers
Answered by
1
Answer:
Domingo I will send you video chat with
Answered by
1
Answer:
4
Explanation:
Similar questions