remember - 4.(done) Maximum number of nodes in a tree with...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Sheet1 Page 1 void main() { int a[]={9,4,1,7,5} int *p printf("%d",p[-1]) } (in this declaration p is defined as an array in which the zeroth element is the 3rd element of the array a so the -1th element of the array p is element 1)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 4.(done) Maximum number of nodes in a tree with n levels. (a)2^(n-1) (b)(2^n)-1 (ans) (c)2^(n-1) - 1 5.(done) Complete graphwith n nodes have (a)n-1 edges (b)n(n-1)/2 (ans)...
View Full Document

This note was uploaded on 06/27/2010 for the course MACS MCA taught by Professor Brs during the Spring '10 term at National Institute of Technology, Calicut.

Ask a homework question - tutors are online