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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent questions in DS
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
Webpage
Arrays,
Stacks,
Queues,
Linked lists,
Trees,
Binary search trees,
Binary heaps,
Graphs.
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
0
votes
0
answers
1
#Testseries
The number of binary search tree’s with 4 nodes (1, 2, 3, 4) possible where in every binary search tree ‘1’ is leaf node are ..... How to solve such type of questions in the simple way?
asked
6 days
ago
in
DS
by
himgta
(
417
points)

39
views
0
votes
1
answer
2
Data Structures
Arrange the following Datastructures in the nondecreasing order of worst case time complexities on the operation $Search$ Binary Search Trees, Linked List, Array, Hash Table
asked
Apr 10
in
DS
by
Neelay Upadhyaya
Junior
(
935
points)

33
views
+1
vote
1
answer
3
test series
Stack valid permutation , They haven't mentioned anywhere that input is in ascending order
asked
Mar 30
in
DS
by
mehul vaidya
Junior
(
593
points)

39
views
0
votes
1
answer
4
testseries
Data structure for loop. What is oxf ? can somebody explain
asked
Mar 30
in
DS
by
mehul vaidya
Junior
(
593
points)

36
views
+1
vote
1
answer
5
What is correct about statements S1 and S2?
asked
Mar 29
in
DS
by
Sandy Sharma
(
235
points)

55
views
graphtheory
+4
votes
1
answer
6
Binary Tree
What is the number of binary trees with 4 nodes which when traversed in preorder gives the sequence 1,2,3,4?
asked
Mar 22
in
DS
by
srestha
Veteran
(
81.7k
points)

130
views
datastructure
binarytree
+3
votes
0
answers
7
Binary Search Tree
When searching for the key value 30 in a binary search tree, nodes containing the key values 10, 20, 25, 35, 70, 80, 90, 100 are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search ...  what is difference between solution 1) and solution 2)? why in both case answer is different?
asked
Mar 22
in
DS
by
srestha
Veteran
(
81.7k
points)

70
views
datastructure
bst
0
votes
0
answers
8
BFSBreadth first search
State True or False with explanation The depth of a breadthfirst search tree on an undirected graph $G = (V, E)$ from an arbitrary vertex $v \in V$ is the diameter of the graph $G$. (The diameter $d$ of a graph is the smallest $d$ such that every pair of vertices $s$ and $t$ have $\delta(s, t) \leq d$)
asked
Mar 21
in
DS
by
akshat sharma
Active
(
1.5k
points)

57
views
bfs
datastructure
0
votes
2
answers
9
Tree question
In delete operation of BST, we need inorder successor (or predecessor) of a node when the node to be deleted has both left and right child as nonempty. Which of the following is true about inorder successor needed in delete operation? Inorder Successor ... Inorder successor may be an ancestor of the node Inorder successor is always either a leaf node or a node with empty right child
asked
Mar 21
in
DS
by
Mohit Srivastava
(
31
points)

38
views
datastructure
tree
+1
vote
0
answers
10
GATE1997_16
In this GATE ques Part a) For Size balanced tree the recurrence (max height) is T(h)=T(h1) +T(h2) +1, solving which we get T(0)=1, T(1)=2,T(2)=1+2+1=4, T(3)=4+2+1=7 Here, T(0),T(1),T(2) are of the form 2h but T(3) is not equal to 23 then how can we claim that "sizebalance binary tree of height 'h' contain at least 2h nodes." ?
[closed]
asked
Mar 14
in
DS
by
Mamta Satywali
Active
(
2.2k
points)

99
views
gate1997
datastructure
binarytree
+1
vote
1
answer
11
AVL tree
Consider the following elements inserted into an empty AVL tree in the following order 25, 10, 15, 17, 30, 35, 40, 21, 28 If [L(d)] be the sum of elements on left side of root and (Rd) be the sum of elements on right side of root, then the value of [(Rd) – (Ld) + Root] is ________.
asked
Mar 11
in
DS
by
pankaj_vir
Loyal
(
6.2k
points)

55
views
avltree
datastructure
tree
+1
vote
2
answers
12
test_series
Data structure BST I thinks answer is 2 either ascending or descending
asked
Mar 11
in
DS
by
mehul vaidya
Junior
(
593
points)

36
views
0
votes
2
answers
13
testseries
Time complexity circular LL i think aswer is A . this Q is similar to https://gateoverflow.in/61880/complexity but here they haven't mentioned about any pointer. here is my explanation
asked
Mar 11
in
DS
by
mehul vaidya
Junior
(
593
points)

46
views
0
votes
1
answer
14
test series
When searching for the key value 50 in a binary search tree, the node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number of different orders passing in which these keys values can occur on the search path from the root to the node containing the value 50 is ________.
[closed]
asked
Mar 10
in
DS
by
pankaj_vir
Loyal
(
6.2k
points)

55
views
+1
vote
2
answers
15
wooe test
In what order we should insert the following elements into an empty AVL tree so that we don’t have to perform any rotation on it. 1, 2, 3, 4, 5, 6, 7 A. 4, 2, 1, 6, 3, 5, 7 B. 4, 2, 6, 1, 3, 5, 7 C. 6, 4, 5, 7, 1, 2, 3 D. 4, 5, 3, 2, 1, 6, 7
[closed]
asked
Mar 10
in
DS
by
pankaj_vir
Loyal
(
6.2k
points)

62
views
avltree
+1
vote
1
answer
16
Heaps
How many Binary MaxHeaps can be constructed from the elements {1,1,2,2,3,3,4,4} ?
asked
Mar 3
in
DS
by
Balaji Jegan
Junior
(
883
points)

161
views
heap
datastructure
0
votes
0
answers
17
How large can the ratio of two memory requirements get?
asked
Mar 3
in
DS
by
XbrucewayneX
(
93
points)

56
views
datastructure
arrays
spacecomplexity
0
votes
1
answer
18
Satellite Data in Data Structure
What exactly is Satellite Data in Data structures? struct BST { int key; char name[20]; struct BST* left; struct BST* right; struct BST* parent; }; What will be satellite data in above node considering BST in made with 'int key' as key?Is structure essential data like left,right,parent pointer for tree implementation a part of satellite data?
asked
Mar 1
in
DS
by
rdfan19
Junior
(
715
points)

63
views
datastructure
terminology
0
votes
0
answers
19
#Data Structure
I was asked sometime ago in an interview draw generalised form of AVL tree that will contain all four rotations of AVL tree. I got confused I tried to explain them such notations one by one by drawing a tree on the board but they insisted me of some generalised form. Kindly help
asked
Feb 19
in
DS
by
Khursheed Bhat
(
29
points)

71
views
datastructure
avltree
0
votes
4
answers
20
trees
Given a preorder, postorder and inorder traversal of a tree, is it always possible to obtain a tree that satisfies each of the three conditions? Or is it possible to not obtain a tree at all?
asked
Feb 19
in
DS
by
Parimal Paritosh
(
169
points)

103
views
binarytree
algorithms
spanningtree
binarysearchtree
+5
votes
4
answers
21
GATE201820
The postorder traversal of a binary tree is 8, 9, 6, 7, 4, 5, 2, 3, 1. The inorder traversal of the same tree is 8, 6, 9, 4, 7, 2, 5, 1, 3. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is _____
asked
Feb 14
in
DS
by
gatecse
Boss
(
17.8k
points)

1.2k
views
gate2018
datastructure
binarytree
numericalanswers
+6
votes
2
answers
22
GATE20183
A queue is implemented using a noncircular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let $n$ denote the number of nodes in the queue. Let 'enqueue' be implemented by inserting a new node at the head, and 'dequeue' be implemented by deletion ... $\theta(1), \theta(1)$ $\theta(1), \theta(n)$ $\theta(n), \theta(1)$ $\theta(n), \theta(n)$
asked
Feb 14
in
DS
by
gatecse
Boss
(
17.8k
points)

1.6k
views
gate2018
algorithms
datastructure
queues
normal
linkedlists
0
votes
0
answers
23
#Gate2018
Answer and explanation?
[closed]
asked
Feb 14
in
DS
by
dark.hacker.beyhadh
(
155
points)

80
views
crossedge
0
votes
1
answer
24
linked list
the sorage requirements of a linked stack with n elements will be what
asked
Feb 9
in
DS
by
kd.....
(
63
points)

87
views
linkedlists
datastructure
algorithms
programminginc
0
votes
3
answers
25
gate cs 2018
for what value of x it will have maximum number of minimum spanning trees ? what is the number of minimum spanning trees
asked
Feb 4
in
DS
by
akshayakrant
(
77
points)

787
views
+6
votes
1
answer
26
Binary Search Tree
Q1. How many binary search trees possible with $11$ distinct key? Q2. How many binary search trees possible with $11$ unlabelled nodes? Q3. How many binary search trees possible with $11$ labelled nodes? Q4. How many binary trees possible with $11$ ... Q5. How many binary trees possible with $11$ unlabelled nodes? Q6. How many binary trees possible with $11$ labelled nodes?
asked
Feb 2
in
DS
by
Lakshman Patel RJIT
Loyal
(
7.5k
points)

209
views
datastructure
binarysearchtree
binarytree
0
votes
0
answers
27
Made easy doubt
Consider the following keys that are hashed into the hash table in the given order using the hash function H(key) = key mod 11. 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 21 Where hash table using quarditic probing of mod11 to handle the collisions, ... go inside the hash table ________ (value will be a whole number). I can't understand what is "i" is it number of collision?
asked
Feb 1
in
DS
by
ankit_thawal
Active
(
2.1k
points)

47
views
0
votes
2
answers
28
Test Series
Delete the key sequence [6,5,4] from the below AVL tree. How many rotations are needed to make it balanced AVL tree again?
asked
Jan 31
in
DS
by
Meghaaa2612
(
19
points)

64
views
data
datastructure
avltree
bst
0
votes
0
answers
29
last level order.
Consider the following last level order strategy for traversing a binary tree: Visit right sub tree using last level order. Visit left sub tree using last level order. Visit root. Assume ↑ is power operator and it has the highest precedence and follows right associativity. The last level order traversal of ... 7, *, 1, 7, ↑, /, 7, +,  7, 7, 1, *, 1, 7, ↑, /, 7, +, 
asked
Jan 31
in
DS
by
Rohit Gupta 8
Active
(
2.1k
points)

49
views
datastructure
0
votes
0
answers
30
#Push & #Pop
A queue is implemented using two stacks S1 and S2. Initially the queue contains 1, 2, 3, 4 from front to rear. The following operations are performed in the queue: delete, insert (5), delete, Then how many total no. of push and pop operations are needed to perform the above operation? a) Push: 12 Pop: 13 b) Push: 15 Pop: 16 c) Push: 11 Pop: 10 d) Push: 12 Pop: 11
asked
Jan 31
in
DS
by
Tuhin Dutta
Loyal
(
7.6k
points)

76
views
datastructure
stack
queue
Page:
1
2
3
4
5
6
...
33
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Members at the site
Mk Utkarsh
vincy
aishwarydewangan
Sumeet Singh
Kushagra Chatterjee
amit sarkar
aambazinga
Sankalp20894
Tanuj Guha Thakurta
Recent Posts
barc result
Suggestion for IIITH exam
Placement Statistics for Computer Science
IIT Bombay Admission
ISRO 2018
All categories
General Aptitude
1.2k
Engineering Mathematics
4.9k
Digital Logic
2k
Programming & DS
3.6k
Programming
2.6k
DS
964
Algorithms
3k
Theory of Computation
3.9k
Compiler Design
1.5k
Operating System
2.8k
Databases
2.9k
CO & Architecture
2.5k
Computer Networks
2.9k
Non GATE
949
Others
1.3k
Admissions
408
Exam Queries
419
Tier 1 Placement Questions
17
Job Queries
54
Projects
9
Follow @csegate
Gatecse
Recent questions in DS
Recent Blog Comments
Yes. I cleared the test and got selected.
Did you clear the test? Were you selected?
No. There was no penalty. We were allowed to ...
You have to write the entire code. I attempted 5 ...
Let's say c = 5 and p = ...
34,774
questions
41,739
answers
118,909
comments
41,388
users