Binary Tree
Q42.
Consider the following C program segment struct CellNode { struct CelINode *leftchild; int element; struct CelINode *rightChild; } int Dosomething(struct CelINode *ptr) { int value = 0; if (ptr != NULL) { if (ptr->leftChild != NULL) value = 1 + DoSomething(ptr->leftChild); if (ptr->rightChild != NULL) value = max(value, 1 + DoSomething(ptr->rightChild)); } return (value); } The value returned by the function DoSomething when a pointer to the root of a non-empty tree is passed as argument isQ43.
Choose the correct alternatives (More than one may be correct).The total external path length, EPL, of a binary tree with n external nodes is, \Sigma _w=Iw, where I_{w} is the path length of external node w),Q44.
Consider the following nested representation of binary trees: (X Y Z) indicates Y and Z are the left and right subtrees, respectively, of node X. Note that Y and Z may be NULL, or further nested. Which of the following represents a valid binary tree?Q45.
Choose the correct alternatives (More than one may be correct).The number of rooted binary trees with n nodes is,Q46.
Which of the following sequences denotes the post order traversal sequence of the below tree?Q48.
A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as