search
Log In

Questions by Mr_22B

1 vote
1 answer
1
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 single node is 0.]
asked Dec 10, 2017 in Programming 112 views
0 votes
2 answers
2
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)
asked Dec 10, 2017 in Programming 509 views
2 votes
2 answers
3
(1). Both BFS and DFS require $\Omega (N)$ storage for their operation. (2). If we double the weight of every edge in the Graph shortest path between any two vertices will not change. Which of the following is/are True ? (and in every question of shortest path we have to think about negative weight ?)
asked Nov 7, 2017 in Algorithms 427 views
...