closed by
299 views

Related questions

0 votes
0 votes
0 answers
1
Sankaranarayanan P.N asked Oct 27, 2016
410 views
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 min...
0 votes
0 votes
0 answers
2
Sankaranarayanan P.N asked Oct 27, 2016
318 views
The maximum number of edges in an acyclic undirected graph with n verticesA) n - 1B) nC) n +1D) 2n -1
0 votes
0 votes
0 answers
3
Sankaranarayanan P.N asked Oct 27, 2016
362 views
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...