Recent questions tagged binary-search-tree / GATE Overflow for GATE CSE

2 votes

1 answer

1

GATE CSE 2024 | Set 2 | Question: 29
You are given a set $V$ of distinct integers. A binary search tree $T$ is created by inserting all elements of $V$ one by one, starting with an empty tree. The tree $T$ follows the convention that, at each node, all values ... determined from $V$ Preorder traversal of $T$ can be determined from $V$ Postorder traversal of $T$ can be determined from $V$

You are given a set $V$ of distinct integers. A binary search tree $T$ is created by inserting all elements of $V$ one by one, starting with an empty tr...

Arjun

2.1k views

Arjun asked Feb 16

5 votes

2 answers

2

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 44
Let $B$ be a binary search tree (BST) with eight nodes filled with the following set of eight integer keys $A=\{10,2,5,3,20,15,9,22\}$. The order in which these keys were inserted to create $B$ is not known. However ... are required to verify if all eight keys of $A$ are present in $B$. How many leaf nodes are present in B?

Let $B$ be a binary search tree (BST) with eight nodes filled with the following set of eight integer keys $A=\{10,2,5,3,20,15,9,22\}$. The order in which these keys were...

GO Classes

554 views

GO Classes asked Feb 5

6 votes

1 answer

3

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 16
Suppose we constructed the binary search tree shown by starting with an empty tree and inserting one element at a time from an input sequence, without any rotations or other manipulations. Which of the following assertions about the order of elements in ... $29$ came before $42.$ $3$ came before $14$ and $16$ came before $28.$

Suppose we constructed the binary search tree shown by starting with an empty tree and inserting one element at a time from an input sequence, without any rotations or ot...

GO Classes

504 views

GO Classes asked Jan 28

0 votes

1 answer

4

Binary Search Tree
when searching for the key 60 in a binary search tree containing nodes: 10,20,40,50,70,80,90 are traversed, not nessesarily in this same order. How many different orders are possible in which these keys can occur on the search path from the root node to the node containing key:60 ??

when searching for the key 60 in a binary search tree containing nodes: 10,20,40,50,70,80,90 are traversed, not nessesarily in this same order.How many different orders a...

rupamsardar

321 views

rupamsardar asked Sep 17, 2023

1 votes

1 answer

5

Suppose a BST is converted into an AVL tree. Which of the following statements is correct?
Suppose a BST is converted into an AVL tree. Which of the following statements is correct? a. The in-order traversal of the AVL tree and the BST will be the same. b. The pre-order traversal of the AVL tree and ... c. The post-order traversal of the AVL tree and the BST will be the same. d. None of the above.

Suppose a BST is converted into an AVL tree. Which of the following statements is correct?a. The in-order traversal of the AVL tree and the BST will be the same.b. The pr...

dhruba

638 views

dhruba asked Jun 5, 2023

1 votes

1 answer

6

GO Classes 2024 | IIITH Mock Test 5 | Question: 36
The preorder traversal sequence of a binary search tree is $26 , 21 , 11 , 6 , 2 , 9 , 13 , 18 , 23 , 38 , 30 , 29 , 42 , 41 , 50 , 43 , 60.$ ... $2 , 9 , 6 , 18 , 13 , 11 , 23 , 21 , 29 , 30 , 41 , 43 , 60 , 50 , 42 , 38 , 26$

The preorder traversal sequence of a binary search tree is $$26 , 21 , 11 , 6 , 2 , 9 , 13 , 18 , 23 , 38 , 30 , 29 , 42 , 41 , 50 , 43 , 60.$$ Which one of the following...

GO Classes

113 views

GO Classes asked Apr 30, 2023

2 votes

1 answer

7

GO Classes 2024 | IIITH Mock Test 5 | Question: 47
To print all keys of a $\text{BST}$ in decreasing order, we use the following traversal order Preorder traversal Postorder traversal Inorder traversal None of the above

To print all keys of a $\text{BST}$ in decreasing order, we use the following traversal orderPreorder traversalPostorder traversalInorder traversalNone of the above

GO Classes

176 views

GO Classes asked Apr 30, 2023

0 votes

0 answers

8

isi 2022 PCB
Let B be a binary search tree (BST) on eight nodes filled with the following set of eight integer keys A = {10, 2, 5, 3, 20, 15, 9, 22}. The order in which these keys were inserted to create B is not known. However, it is ... construct and depict pictorially four possible BSTs each of which requires 36 comparisons to check the presence of all the eight keys in A. Justify your answer

Let B be a binary search tree (BST) on eight nodes filled with the following set of eight integer keys A = {10, 2, 5, 3, 20, 15, 9, 22}. The order in which these keys wer...

Ray Tomlinson

418 views

Ray Tomlinson asked Apr 12, 2023

1 votes

1 answer

9

GO Classes 2023 | IIITH Mock Test 1 | Question: 31
Suppose numbers from $1$ to $1000$ are saved in a binary search tree and we want to find $363.$ Which of the following sequences cannot be the order of elements while reaching the searched value? $925,202,911,240,912,245,363$ $924,220,911,244,898,258,362,363$ $2,252,401,398,330,344,397,363$ $2,399,387,219,266,382,381,278,363$

Suppose numbers from $1$ to $1000$ are saved in a binary search tree and we want to find $363.$ Which of the following sequences cannot be the order of elements while rea...

GO Classes

749 views

GO Classes asked Mar 26, 2023

0 votes

1 answer

10

binary search tree
Consider a binary search tree, while searching the key value 4, key values 1, 2, 3, 6, 8, 9, 10 and 11 are traversed not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing value 4?

Consider a binary search tree, while searching the key value 4, key values 1, 2, 3, 6, 8, 9, 10 and 11 are traversed not necessarily in the order given. How many differen...

someshawasthi

494 views

someshawasthi asked Feb 27, 2023

0 votes

0 answers

11

TestBook TestSeries Optimal Binary Search Tree Question
Construct OBST with the identifier set (a1, a2, a3) =(end , goto, print) with p(1..3) = (0.05, 0.2, 0.1) and q(0..3) = (0.2, 0.1,0.2, 0.05) What is the cost of a OBST ? What are the nodes present in the 2nd level of OBST if the root is present in level one ? 2.55 , print , goto 2.45 , goto , end 2.15, end, print 2.7, end, goto

Construct OBST with the identifier set (a1, a2, a3) =(end , goto, print) with p(1..3) = (0.05, 0.2, 0.1) and q(0..3) = (0.2, 0.1,0.2, 0.05)What is the cost of a OBST ? ...

Sahil_Lather

476 views

Sahil_Lather asked Jan 28, 2023

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