GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation

Best Answer to Any Question

Ask a Question

distinct binary search trees can be created distinct keys

0 votes

How many distinct binary search trees can be created out of 4 distinct keys?

A	4
B	14
C	24
D	42

asked in trees, binary search trees, binary heaps by gate

Your answer

Your name to display (optional):

Email me at this address if my answer is selected or commented on:Email me if my answer is selected or commented on

Privacy: Your email address will only be used for sending these notifications.

Anti-spam verification:

To avoid this verification in future, please log in or register.

1 Answer

0 votes

B

14

No. of BST= ²ⁿC_n/(n+1)

therefore ⁸C₄/5 =14 option b

answered by gate

Your comment on this answer:

Your name to display (optional):

Email me at this address if a comment is added after mine:Email me if a comment is added after mine

Privacy: Your email address will only be used for sending these notifications.

Anti-spam verification:

To avoid this verification in future, please log in or register.

Related questions

0 votes

1 answer

maximum number of binary trees that can be formed with three unlabeled nodes

The maximum number of binary trees that can be formed with three unlabeled nodes is: A 1 B 5 C 4 D 3

asked in trees, binary search trees, binary heaps by gate

0 votes

1 answer

number of ways in which the numbers can be inserted in an empty binary search tree

The number of ways in which the numbers 1, 2, 3, 4, 5, 6, 7 can be inserted in an empty binary search tree, such that the resulting tree has height 6, is _____________ Note: The height of a tree with a single node is 0.

asked in trees, binary search trees, binary heaps by gate

0 votes

1 answer

maximum and minimum no of keys can be present in leaf nodes in B trees

What is the maximum and minimum no of keys can be present in leaf nodes in B trees if the order of the B tree is p?

asked in File organization, indexing (B and B+ trees) by gatefoum

maximum-minimum
keys
leaf-nodes
b-trees-order

0 votes

1 answer

preferring B-trees to binary search trees for indexing database relations

Which one of the following is a key factor for preferring B-trees to binary search trees for indexing database relations? A Database relations have a large number of records B Database relations are sorted on the primary key C B-trees require less memory than binary search trees D Data transfer form disks is in blocks.

asked in File organization, indexing (B and B+ trees) by gate

0 votes

1 answer

self-adjusting or self-balancing Binary Search Tree

Which of the following is a self-adjusting or self-balancing Binary Search Tree A Splay Tree B AVL Tree C Red Black Tree D All of the above

asked in trees, binary search trees, binary heaps by gate

0 votes

0 answers

worst-case complexities of insertion and deletion of a key in a binary search tree

worst-case complexities of insertion and deletion of a key in a binary search tree The time taken by search, insert and delete on a BST is always proportional to height of BST. Height may become O(n) in worst case.

asked in trees, binary search trees, binary heaps by gate

0 votes

1 answer

preorder traversal sequence of a binary search tree

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree? A 10, 20, 15, 23, 25, 35, 42, 39, 30 B 15, 10, 25, 23, 20, 42, 35, 39, 30 C 15, 20, 10, 23, 25, 42, 35, 39, 30 D 15, 10, 23, 25, 20, 35, 42, 39, 30

asked in trees, binary search trees, binary heaps by gate

0 votes

2 answers

worst case time complexity for search, insert and delete operations in a Binary Search Tree

What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree? A O(n) for all B O(Logn) for all C O(Logn) for search and insert, and O(n) for delete D O(Logn) for search, and O(n) for insert and delete

asked in trees, binary search trees, binary heaps by gate

0 votes

1 answer

Breadth First Search (BFS) is started on a binary tree beginning from the root vertex

Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex t at a distance four from the root. If t is the n-th vertex in this BFS traversal, then the maximum possible value of n is ________

asked in trees, binary search trees, binary heaps by gate

0 votes

1 answer

Postorder traversal of a given binary search tree

Postorder traversal of a given binary search tree, T produces the following sequence of keys 10, 9, 23, 22, 27, 25, 15, 50, 95, 60, 40, 29 Which one of the following sequences of keys can be the result of an in-order traversal of the tree T? A 9, 10, 15, 22, 23, 25, 27, 29, 40, 50, 60, 95 B 9, 10, 15, 22, 40, 50, 60, 95, 23, 25, 27, 29 C 29, 15, 9, 10, 25, 22, 23, 27, 40, 60, 50, 95 D 95, 50, 60, 40, 27, 23, 22, 25, 10, 9, 15, 29

asked in trees, binary search trees, binary heaps by gate

The best answer to any question

All categories
Computer Science & Information Technology 451
- Computer Science 9
- Information Technology 0
- Digital Logic 10
- Computer Architecture 28
- Programming 38
- Data Structures 67
  - data structures 2
  - data structures and algorithms 6
  - Recursion 6
  - Arrays, stacks, queues 17
  - linked lists 10
  - trees, binary search trees, binary heaps 15
  - graphs 11
- Algorithms 66
- Theory of Computation 45
- Compiler Design 28
- Operating System 44
- Databases 46
- Computer Networks 65
Mathematics 80
Aptitude Questions 114
GATE 94
Online Aptitude Test 6
Gate Exam 22
Gate Syllabus 6
Gate Preparation 35
Gate Coaching 14
Online Registration 20
Electronics and Communication (EC) 0
Electrical Engineering (EE) 3
Civil Engineering (CE) 0
Mechanical Engineering (ME) 2
Aerospace Engineering (AE) 0
Agricultural Engineering (AG) 0
Architecture and Planning (AR) 0
Biotechnology (BT) 0
Chemical Engineering (CH) 1
Chemistry (CY) 0
Ecology and Evolution (EY) 0
Geology and Geophysics (GG) 0
Instrumentation Engineering (IN) 0
Mining Engineering (MN) 0
Metallurgical Engineering (MT) 0
Petroleum Engineering (PE) 0
Physics (PH) 0
Production and Industrial Engineering (PI) 1
Textile Engineering and Fibre Science (TF) 0
Engineering Sciences 0
Life Sciences 1
Mathematics (MA) 0

Related questions

maximum number of binary trees that can be formed with three unlabeled nodes
number of ways in which the numbers can be inserted in an empty binary search tree
maximum and minimum no of keys can be present in leaf nodes in B trees
preferring B-trees to binary search trees for indexing database relations
self-adjusting or self-balancing Binary Search Tree
worst-case complexities of insertion and deletion of a key in a binary search tree
preorder traversal sequence of a binary search tree
worst case time complexity for search, insert and delete operations in a Binary Search Tree
Breadth First Search (BFS) is started on a binary tree beginning from the root vertex
Postorder traversal of a given binary search tree

Send feedback
Study Material
© GATEFORUM.ORG
XML Sitemap

Powered by Question2Answer

GATEFORUM.ORG