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
GATE Overflow | Data Structures | Test 1 | Question: 14
Arjun
asked
in
DS
Oct 10, 2016
102
views
0
votes
0
votes
Consider the array given below:
20 10 9 8 7 6 5
It is
a full binary tree in array representation
a complete binary tree in array representation
a max-heap in array representation
all of the above
go-ds-1
data-structures
binary-tree
binary-heap
Arjun
asked
in
DS
Oct 10, 2016
by
Arjun
102
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
1
vote
1
vote
Best answer
option D
Hira Thakur
answered
Nov 8, 2016
selected
Nov 8, 2016
by
Arjun
by
Hira Thakur
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
Answer:
D
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
1
answer
1
Arjun
asked
in
DS
Oct 10, 2016
246
views
GATE Overflow | Data Structures | Test 1 | Question: 12
What is the content of the array after two delete operations on the binary heap 10 5 8 4 3? 5 4 3 5 3 4 10 5 8 8 4 3
Arjun
asked
in
DS
Oct 10, 2016
by
Arjun
246
views
go-ds-1
data-structures
binary-heap
1
vote
1
vote
1
answer
2
Arjun
asked
in
DS
Oct 10, 2016
88
views
GATE Overflow | Data Structures | Test 1 | Question: 11
Which one of the following array represents a binary max-heap? 20 13 4 11 3 12 2 20 13 4 12 11 3 2 20 13 4 3 2 12 11 20 13 4 12 3 11 2
Arjun
asked
in
DS
Oct 10, 2016
by
Arjun
88
views
go-ds-1
data-structures
binary-heap
1
vote
1
vote
2
answers
3
Arjun
asked
in
DS
Oct 10, 2016
273
views
GATE Overflow | Data Structures | Test 1 | Question: 25
Consider the following nested representation of Binary Trees. $(ABC)$ indicates $B$ and $C$ are left and right subtrees of node $A$ respectively. Note that $B$ and $C$ may be NULL or further nested. Which of the following representation is not a valid Binary tree? (1 2 3) (1 (2 3 4) (5 6 7)) (1 (1 (1 1 1) (1 1 1)) (1 1 1)) (1 (2 3) 4)
Arjun
asked
in
DS
Oct 10, 2016
by
Arjun
273
views
go-ds-1
data-structures
binary-tree
5
votes
5
votes
5
answers
4
Arjun
asked
in
DS
Oct 10, 2016
487
views
GATE Overflow | Data Structures | Test 1 | Question: 16
A program takes as input a binary tree (not necessarily balanced) with $n$ nodes and computes for each node, the no. of leaf nodes in the sub-tree rooted at that node. The worst case time complexity of the program is $\Theta(n)$ $\Theta(n \log n)$ $\Theta\left(n^2 \right)$ $\Theta\left(n^2 \log n \right)$
Arjun
asked
in
DS
Oct 10, 2016
by
Arjun
487
views
go-ds-1
data-structures
binary-tree
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
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
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.7k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Recommend test series??
pressman pdf/ geeksforgeeks
where to study software engineering for BARC
+1
1200/1000 = 1.2
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
