**BST are always labeled trees**

what is need of binary search tree without labeled keys

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+1 vote

I have doubt when its asked to know number of labelled and unlabelled binary tree :

For labelled = (On basis of labelling)

T(n) = 2nCn/(n+1) * n!

For unlabelled = (On Basis of Geometric Sturucture)

T(n) = (2n)Cn/n+1

Right?

What if its Asked for BST what will be the answer in both the above cases and Why?

+1

https://gatecse.in/number-of-binary-trees-possible-with-n-nodes/

It will always be labeled as said above and will be equal to Catalan number, for why read above post.

0 votes

since, u have metioned that u need no of binary search tree definitely u must have unique searching sequence , so there will be only one bst for given sequence , and also keep in mind bst is always drawn for values which is comparable among each other thats why we have only one bst for given sequence.

- All categories
- General Aptitude 1.8k
- Engineering Mathematics 7.3k
- Digital Logic 2.9k
- Programming & DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6k
- Compiler Design 2k
- Databases 4.1k
- CO & Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.4k
- Others 1.4k
- Admissions 596
- Exam Queries 577
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

49,532 questions

54,123 answers

187,321 comments

71,045 users