Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
NIELIT Scientific Assistant A 2020 November: 93
gatecse
asked
in
DS
Dec 9, 2020
recategorized
Jul 5, 2022
by
Lakshman Patel RJIT
118
views
1
vote
1
vote
When we perform in order traversal on a binary tree, we get the ascending order array. The tree is:
Heap tree
almost complete binary tree
Binary search tree
Cannot be determined
nielit-sta-2020
data-structures
binary-search-tree
gatecse
asked
in
DS
Dec 9, 2020
recategorized
Jul 5, 2022
by
Lakshman Patel RJIT
by
gatecse
118
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
0
votes
option C as one of the very basic characteristics of binary search tree.
Asim Siddiqui 4
answered
Mar 19, 2021
by
Asim Siddiqui 4
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
Answer:
C
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
1
answer
1
gatecse
asked
in
DS
Dec 9, 2020
139
views
NIELIT Scientific Assistant A 2020 November: 58
A stack can be implemented using queue, but then we need to use atleast : $3$ queues $2$ queues only one queue is sufficient none of the options
gatecse
asked
in
DS
Dec 9, 2020
by
gatecse
139
views
nielit-sta-2020
data-structures
queue
1
vote
1
vote
1
answer
2
gatecse
asked
in
DS
Dec 9, 2020
367
views
NIELIT Scientific Assistant A 2020 November: 109
A program $\text{P}$ reads in $500$ integers in the range $[0\dots100]$ representing the scores of $500$ students. It then prints the frequency of each score above $50.$ What would be the best way for $\text{P}$ to store the ... An array of $50$ numbers An array of $100$ numbers An array of $500$ numbers A dynamically allocated array of $550$ numbers
gatecse
asked
in
DS
Dec 9, 2020
by
gatecse
367
views
nielit-sta-2020
data-structures
array
easy
1
vote
1
vote
1
answer
3
gatecse
asked
in
DS
Dec 9, 2020
154
views
NIELIT Scientific Assistant A 2020 November: 114
Priority queue is implemented by : Doubly link list Graph Heap Stack
gatecse
asked
in
DS
Dec 9, 2020
by
gatecse
154
views
nielit-sta-2020
data-structures
queue
1
vote
1
vote
1
answer
4
gatecse
asked
in
DS
Dec 9, 2020
138
views
NIELIT Scientific Assistant A 2020 November: 115
A recursive problem like tower of hanoi can be rewritten without recursion using: stack priority queue graph cycles
gatecse
asked
in
DS
Dec 9, 2020
by
gatecse
138
views
nielit-sta-2020
data-structures
stack
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recent Posts
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Programming
(3.9k)
DS
(1.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
@Aakash_Bhardwaj all the best bro . For your...
What's the answer for keystroke question
Same,easy to moderate
I felt paper was very much like AIMT 3!!
very easy paper, I don't want to discuss paper...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
