edited by
284 views
0 votes
0 votes
Let $T$ be a rooted ternary tree where each internal node of $T$ has a maximum of $3$ children. If root is at depth $0$, then maximum total number of vertices $T$ can have with depth $3$ is ______.
edited by

1 Answer

Best answer
3 votes
3 votes
For the tree to have maximum total no of vertices, all nodes must have 3 children
So total no of nodes for depth 3 = 3^0 + 3^1 + 3^2 + 3^3 = 40
selected by
Answer:

Related questions

2 votes
2 votes
2 answers
2
Bikram asked May 26, 2017
341 views
Assume Dijkstra's Algorithm is used to find the shortest paths from node G in the above graph. The total number of edges which are not included in any of the shortest pat...
1 votes
1 votes
2 answers
3
Bikram asked May 26, 2017
454 views
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.
0 votes
0 votes
1 answer
4
Bikram asked May 26, 2017
303 views
Consider the following instance of the knapsack problem :$\begin{array}{|c|c|c|c|c|c|} \hline \text{Item} & a & b & c & d & e \\ \hline \text{Benefit} & 15 & 12 & 9 & 16 ...