1
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
The maximum number of binary trees that can be formed with three unlabeled nodes is:
A
1
B
5
C
4
D
3
2
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is:
A
2h-1
B
2h-1-1
C
2h+1-1
D
2h+1
3
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
4
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
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12