1
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the following C program segment where CellNode represents a node in a binary tree:
struct CellNode 
{ 
     struct CellNOde *leftChild; 
     int element; 
     struct CellNode *rightChild; 
}; 

int GetValue(struct CellNode *ptr) 
{ 
     int value = 0; 
     if (ptr != NULL) 
     { 
       if ((ptr->leftChild == NULL) && 
        (ptr->rightChild == NULL)) 
       value = 1; 
       else 
         value = value + GetValue(ptr->leftChild) 
             + GetValue(ptr->rightChild); 
     } 
     return(value); 
} 
The value returned by GetValue() when a pointer to the root of a binary tree is passed as its argument is:
A
the number of nodes in the tree
B
the number of internal nodes in the tree
C
the number of leaf nodes in the tree
D
the height of the tree
2
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
The inorder and preorder traversal of a binary tree are d b e a f c g and a b d e c f g, respectively. The postorder traversal of the binary tree is:
A
d e b f g c a
B
e d b g f c a
C
e d b f g c a
D
d e f g b c a
3
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
Which of the following sequences of array elements forms a heap?
A
{23, 17, 14, 6, 13, 10, 1, 12, 7, 5}
B
{23, 17, 14, 6, 13, 10, 1, 5, 7, 12}
C
{23, 17, 14, 7, 13, 10, 1, 5, 6, 12}
D
{23, 17, 14, 7, 13, 10, 1, 12, 5, 7}
4
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
An array X of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is 0. The index of the parent of element X[i],i≠0 is?
A
⌊ i/2 ⌋
B
⌈ (i-1)/2 ⌉
C
⌈ i/2 ⌉
D
⌈ i/2 - 1 ⌉
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP