Recent questions in Programming and DS

1 votes
1 answer
2461
The number of ways we can insert 11, 12, 13, 14, 15, 16, 17 in empty binary search tree such that resulting tree has the height of 6 = ___________ [height of a tree with ...
0 votes
2 answers
2462
What is the time complexity to insert a new Node in a singly circular linked list at Starting ? (Number of nodes in list = N)A. O(1)B. O(N)
6 votes
3 answers
2467
0 votes
2 answers
2469
0 votes
0 answers
2470
0 votes
1 answer
2472
2 votes
1 answer
2473
Let's consider we have a stack with three operations defined on it:: Push,Pop, PeekWe have to print "ABCACBA" using the above operations.Give the min no of operations for...
0 votes
0 answers
2474
R = { (x,y) ∈ z X z : x-y is even integer } is this reflexive how to prove and what this set is representing , z= set of integers
0 votes
0 answers
2476
a and &a are the same thing where a is array name? I am unable to understand diff between (a+1) and (&a+1) when assigned to a pointer #include <stdio.h>int main(){ in...
1 votes
1 answer
2477
For searching an element from heap,then delete it from heapWhy will it take O(n+log n) time and not O(n log n) time?
0 votes
0 answers
2478
1 votes
0 answers
2480
Consider inserting the key 10,22,31,4,15,28,17,88,59 using open addressing technique into hash table of length m=11 with hash function h(k)= k mod 11 what is no of colli...