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. For hardcopy of previous year questions please see
here
GATE20026
+14
votes
466
views
Draw all binary trees having exactly three nodes labeled $A, B$ and $C$ on which preorder traversal gives the sequence $C, B, A$.
gate2002
datastructure
binarytree
easy
descriptive
asked
Sep 16, 2014
in
DS
by
Kathleen
Veteran
(
59.6k
points)
edited
Dec 25, 2017
by
kenzou

466
views
Facebook
Google+
Twitter
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
+14
votes
Best answer
$5$ Binary trees
answered
May 30, 2015
by
Anu
Loyal
(
5.9k
points)
edited
Dec 25, 2017
by
kenzou
comment
0
......
Please
log in
or
register
to add a comment.
–3
votes
Am getting 3 binary trees 1 left skewed ,1 right skewed,1 c as root b as left child and a as right child
answered
Sep 19, 2014
by
Bhagirathi
Boss
(
14.4k
points)
comment
Please
log in
or
register
to add a comment.
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
+45
votes
3
answers
1
GATE20022.12
A weightbalanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest leaf) ... described by which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$
asked
Sep 16, 2014
in
DS
by
Kathleen
Veteran
(
59.6k
points)

4.6k
views
gate2002
datastructure
binarytree
normal
+14
votes
6
answers
2
GATE20021.5
In the worst case, the number of comparisons needed to search a single linked list of length $n$ for a given element is $\log n$ $\frac{n}{2}$ $\log_2 {n}  1$ $n$
asked
Sep 15, 2014
in
DS
by
Kathleen
Veteran
(
59.6k
points)

1.7k
views
gate2002
easy
datastructure
linkedlists
+13
votes
2
answers
3
GATE20025b
Determine whether each of the following is a tautology, a contradiction, or neither ("$\lor$" is disjunction, "$\land$" is conjunction, "$\rightarrow$" is implication, "$\neg$" is negation, and "$\leftrightarrow$" is biconditional (if and only if). $A \leftrightarrow (A \lor A)$ $(A \lor B) \rightarrow B$ $A \land (\neg (A \lor B))$
asked
Nov 7, 2014
in
Mathematical Logic
by
Arjun
Veteran
(
363k
points)

738
views
gate2002
mathematicallogic
easy
descriptive
propositionallogic
+20
votes
1
answer
4
GATE20021.17
In the C language: At most one activation record exists between the current activation record and the activation record for the main The number of activation records between the current activation record and the activation records from the main depends on ... the activation record for the recursive function to be saved in a different stack before the recursive function can be called.
asked
Sep 15, 2014
in
Programming
by
Kathleen
Veteran
(
59.6k
points)

1.9k
views
gate2002
programming
programminginc
easy
descriptive
+16
votes
2
answers
5
GATE20022.6, ISRO200819
The performance of a pipelined processor suffers if: the pipeline stages have different delays consecutive instructions are dependent on each other the pipeline stages share hardware resources All of the above
asked
Sep 16, 2014
in
CO & Architecture
by
Kathleen
Veteran
(
59.6k
points)

2.4k
views
gate2002
coandarchitecture
pipelining
easy
isro2008
+24
votes
2
answers
6
GATE20021.25, ISRO200830, ISRO20166
The maximum number of edges in a nnode undirected graph without self loops is $n^2$ $\frac{n(n1)}{2}$ $n1$ $\frac{(n+1)(n)}{2}$
asked
Sep 16, 2014
in
Graph Theory
by
Kathleen
Veteran
(
59.6k
points)

4.9k
views
gate2002
graphtheory
easy
isro2008
isro2016
graphconnectivity
+22
votes
4
answers
7
GATE20022.9
The number of leaf nodes in a rooted tree of n nodes, with each node having $0$ or $3$ children is: $\frac{n}{2}$ $\frac{(n1)}{3}$ $\frac{(n1)}{2}$ $\frac{(2n+1)}{3}$
asked
Sep 16, 2014
in
DS
by
Kathleen
Veteran
(
59.6k
points)

3.2k
views
gate2002
datastructure
trees
normal
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
SCREENSHOT
Basic LaTeX guide
IIT Madras Phd
Databases GO Classroom
Happy Birthday Sir Arjun
All categories
General Aptitude
1.4k
Engineering Mathematics
6.3k
Digital Logic
2.4k
Programming & DS
4.4k
Programming
3.2k
DS
1.2k
Algorithms
3.8k
Theory of Computation
4.8k
Compiler Design
1.8k
Operating System
3.5k
Databases
3.5k
CO & Architecture
3k
Computer Networks
3.5k
Non GATE
1.2k
Others
1.3k
Admissions
509
Exam Queries
491
Tier 1 Placement Questions
23
Job Queries
64
Projects
17
Follow @csegate
Gatecse
Recent Blog Comments
Sir for final year student who have exam in...
I guess you meant while chasing :) Anyway those...
I'll write a post on how to best...
@Gaurav Go through all the previous yr questions,...
42,619
questions
48,614
answers
155,860
comments
63,850
users