July 17, 2021 in C and CPP The number of sub-tree of a node is called its A. Degree H. front=0, rear= n-1 O. n+1B. n log n I. n P. Dangling pointerC. 1 J. 2 Q. MaximumD. n2 K. Call by reference R. Call by valueE. 3 L. Free space S. minimumF. front= rear = 0 M. -1G. level N. 2e Read More
July 17, 2021 in C and CPP For a binary search tree with n-nodes, External Path Length = Internal Path Length + log2n. Each statement below is either TRUE or FALSE. Choose the most appropriate oneand ENTER in the “tear-off” sheet attached to the question paper, followinginstructions therein. Read More
July 17, 2021 in C and CPP To implement the problem which checks whether parentheses, braces and brackets are in proper position or not, stack has been used. Read More
July 17, 2021 in C and CPP An ordered set of items from which items may be deleted at either end and into which items may be inserted at either end is called. Read More
