Register

Kerala PSC AP Exam

426 views
0 votes
0 votes

In a binary tree, for every node the difference between the number of nodes in the left and right sub trees is atmost 2. If the height of the tree is h > 0  , then the minimum number of nodes in the tree is

A) 2 h-1

B) 2h-1 +1

C) 2h - 1

D) 2h

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Sankaranarayanan P.N asked Oct 27, 2016
308 views
Kerala PSC AP Exam
IN a binary tree, the number of internal nodes of degree one is 5 and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree is A) 15 B) 11 C) 12 D) 10
IN a binary tree, the number of internal nodes of degree one is 5 and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree isA) 15B...
User Avatar
0 votes
0 votes
0 answers
2
Sankaranarayanan P.N asked Oct 27, 2016
330 views
Kerala PSC AP Exam
The maximum number of edges in an acyclic undirected graph with n vertices A) n - 1 B) n C) n +1 D) 2n -1
The maximum number of edges in an acyclic undirected graph with n verticesA) n - 1B) nC) n +1D) 2n -1
User Avatar
0 votes
0 votes
0 answers
3
Sankaranarayanan P.N asked Oct 27, 2016
371 views
Kerala PSC AP Exam
Let P be a singly linked list. Let Q be the pointer to an intermediate node X in the list. What is the worst case time complexity of the best known algorithm to delete node X from the list? A) O(n) B) O(log 2 n) C) O(log n) D) O(1)
Let P be a singly linked list. Let Q be the pointer to an intermediate node X in the list. What is the worst case time complexity of the best known algorithm to delete no...
User Avatar
Link Copied!