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
#Test-series
himgta
asked
in
DS
Apr 13, 2018
134
views
0
votes
0
votes
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?
himgta
asked
in
DS
Apr 13, 2018
by
himgta
134
views
answer
comment
Follow
share this
share
2 Comments
by
Soumya29
commented
Apr 15, 2018
reply
Follow
share this
5 ?
0
0
by
pankaj_vir
commented
Apr 15, 2018
reply
Follow
share this
$n^{th}$
Catalan Number
, where n = 3
Answer is 5
1
1
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
–1
vote
–1
vote
0
answers
1
himgta
asked
in
DS
Sep 12, 2018
123
views
#Test series
himgta
asked
in
DS
Sep 12, 2018
by
himgta
123
views
0
votes
0
votes
0
answers
2
himgta
asked
in
DS
Sep 11, 2018
146
views
#test series
We want to perform reversal of a stack, which mean reversing the contents of the stack and placing it on the same stack. For example if Stack S contains 1 2 3, where 1 being on the top of the stack, then same stack after reversal will contain 3 2 1, where 3 ... need one more stack for reversal of the stack. (iii) We don't need any extra stack. (iv) We need at least two more stacks.
himgta
asked
in
DS
Sep 11, 2018
by
himgta
146
views
0
votes
0
votes
1
answer
3
himgta
asked
in
DS
Sep 11, 2018
581
views
#Test series
Evaluate the given prefix expression,And find the result the of the expression? Say +-*+ABCD*AB ,Where A=4,B=3,C=2,D=5. Answer is 3 or 21??
himgta
asked
in
DS
Sep 11, 2018
by
himgta
581
views
0
votes
0
votes
1
answer
4
himgta
asked
in
DS
Sep 11, 2018
247
views
#Test series
Which of the following is/are true? I. The maximum number of nodes in a complete binary tree of height h is 2h+1-1.(Assume root is at height 0) II. Given the in-order, post order, we can identify the corresponding binary tree uniquely. III. Given ... can identify BST uniquely. IV. The level order of a max heap will result in descending order of element. Explain each of the statement!
himgta
asked
in
DS
Sep 11, 2018
by
himgta
247
views
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.6k)
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
+1
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
