Register

apset-2017 paper-2
closed

• retagged by
350 views
1 votes
1 votes
closed as a duplicate of: GATE CSE 1992 | Question: 02,vii
A 2-3 tree is a tree such that

(i) All the internal nodes have either 2 or 3 children

(ii) All paths from root to the leaves have the same length

The number of internal nodes of 2-3 tree having 9 leaves could be

(A) 4

(B) 5

(C) 6

(D) 8
• retagged by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
admin asked Mar 30, 2020
765 views
NIELIT 2017 July Scientist B (CS) - Section B: 54
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal nodes is $nk$ $(n-1)k+1$ $n(k-1)+1$ $n(k-1)$
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal nodes is$nk$$(n-1)k+1$$n(k-1)+1$$n(k-1)$
User Avatar
38 votes
38 votes
7 answers
2
Arjun asked Feb 14, 2017
18,841 views
GATE CSE 2017 Set 1 | Question: 20
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
User Avatar
1 votes
1 votes
1 answer
3
Devwritt asked Jan 22, 2017
1,646 views
MadeEasy CBT 2017: Programming & DS - Trees
User Avatar
2 votes
2 votes
7 answers
4
go_editor asked Jan 31, 2017
7,660 views
UGC NET CSE | January 2017 | Part 3 | Question: 32
Any decision tree that sorts n elements has height ____ $\Omega (\lg \: n)$ $\Omega (n)$ $\Omega (n \: \lg \: n)$ $\Omega (n^2)$
Any decision tree that sorts n elements has height ____$\Omega (\lg \: n)$$\Omega (n)$$\Omega (n \: \lg \: n)$$\Omega (n^2)$
User Avatar
Link Copied!