Register
Dark Mode

#Test-series

in DS
287 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?
in DS
by
287 views

2 Comments

by
5 ?
0
0
by

$n^{th}$ Catalan Number, where n = 3

Answer is 5

1
1

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

–1 vote
–1 vote
0 answers
1
himgta asked in DS Sep 12, 2018
315 views
#Test series
himgta asked in DS Sep 12, 2018
by himgta
315 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

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

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!