Computer Science, asked by shivrajsingh14071998, 9 months ago

This binary tree contains 13 nodes, and hence we have 13 subtrees here (rooted at each of 13 nodes). How many of them are complete?

Answers

Answered by Anonymous
48

Explanation:

</p><p></p><p></p><p>&lt;svg class= "heart" viewBox= "-2 -2 98.6 90.81"&gt;</p><p></p><p>  &lt;title&gt;Corazon&lt;/title&gt;</p><p>  </p><p>  &lt;text x=8 y=22 dx= "0 0 0 0 0 0 0"  dy= "2 -8 -2  -1 1 2 4 "style= "font: bold .7em arial; fill: red;"&gt; MrÁtharVa</p><p>   &lt;tspan x=60 y=22 style= "font: bold .7em arial; fill: blue;"&gt;ÂtharVa&lt;/tspan&gt;</p><p>   &lt;tspan x= 10 dy= 15 style= "font: bold .6em arial; fill: navy;"&gt; people who 75% at least&lt;/tspan&gt;</p><p>   &lt;tspan x= 25 dy= 10 style= "font: bold .6em arial; fill: navy;"&gt;rr my friends can&lt;/tspan&gt;</p><p>   &lt;tspan x= 35 dy= 10 style= "font: bold .6em arial; fill: navy;"&gt;see the&lt;/tspan&gt;</p><p>   &lt;tspan x= 37 dy= 10 style= "font: bold .5em arial; fill: red;"&gt;HEART&lt;/tspan&gt;</p><p>   </p><p>   &lt;animate attributeType="XML" attributeName="visibility" from="visible" to="hidden" dur="9.2s" begin="0s" /&gt;</p><p>   </p><p>  &lt;/text&gt;</p><p>  </p><p>  &lt;path stroke= "firebrick" stroke-width= "3" d= "M86.81,8.15a27.79,27.79,0,0,1,0,39.33L47.48,86.81,8.15,47.48A27.81,27.81,0,0,1,47.48,8.15,27.79,27.79,0,0,1,86.81,8.15Z"/&gt;</p><p>  </p><p>&lt;/svg&gt;</p><p>&lt;style&gt;</p><p>body {</p><p> display: grid;</p><p> min-height: 100vh;</p><p> justify-content: center;</p><p> align-content: center;</p><p> background: repeating-linear-gradient(circle, white, yellow, red); </p><p> background: repeating-radial-gradient(circle, white, yellow, red);</p><p>}</p><p></p><p></p><p>.heart {</p><p> width: 250px;</p><p> animation: heart-beat .5s 4.85s infinite ease-in-out alternate;</p><p>}</p><p></p><p></p><p>@keyframes heart-beat {</p><p>  to{</p><p>   transform: scale(1.05);</p><p>  }</p><p>}</p><p></p><p></p><p>path {</p><p> fill: none;</p><p> stroke-dasharray: 286;</p><p> stroke-dashoffset: 286;</p><p> animation: heart-path 5s forwards;</p><p> .ocultarText: color:transparent ;</p><p>}</p><p></p><p></p><p>@keyframes heart-path {</p><p> 99% {</p><p>   stroke-dashoffset: 0;</p><p>   fill: none;</p><p> }</p><p> 100% {</p><p>   fill: firebrick;</p><p> }</p><p>}</p><p></p><p>&lt;/style&gt;</p><p></p><p></p><p>

Answered by aharidevi
4

Explanation:

This binary tree contains 13 nodes, and hence we have 13 subtrees here (rooted at each of 13 nodes). How many of the subtrees are complete?

Similar questions