The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by Mr_22B
User Mr_22B
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Mr_22B
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
answer
1
ace test
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

99
views
binarysearchtree
permutationandcombination
0
votes
2
answers
2
Ace Test Series: Programming & DS  Linked Lists
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

443
views
acetestseries
linkedlists
datastructures
+2
votes
2
answers
3
Testbook Test Series: Algorithms  Graph Algorithms
(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

319
views
algorithms
testbooktestseries
graphalgorithms
50,741
questions
57,231
answers
197,991
comments
104,578
users