Dark Mode

Recent questions tagged binary-search-tree

0 votes

1 answer

1

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?

someshawasthi asked in DS Feb 27

by someshawasthi

107 views

0 votes

0 answers

2

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

Sahil_Lather asked in Algorithms Jan 28

by Sahil_Lather

86 views

2 votes

0 answers

3

igate test series
AVL tree is binary search tree with additional property that difference between height of left sub-tree and right sub-tree of any node can’t be more than 1 if n is the number of nodes in a AVL tree . The maximum value of n for which the difference between the minimum height and maximum height of AVL tree is <2 _________ ?

jugnu1337 asked in DS Nov 1, 2022

181 views

0 votes

0 answers

4

Data Structure
Not able to understand the last option.

Overflow04 asked in Programming Oct 2, 2022

128 views

0 votes

0 answers

5

Best Open Video Playlist for Binary search Trees Topic | Data structures
Please list out the best free available video playlist for Binary search Trees from Data structures as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO classroom video ... standard ones are more likely to be selected as best. For the full list of selected videos please see here

makhdoom ghaya asked in Study Resources Aug 16, 2022

by makhdoom ghaya

57 views

24 votes

3 answers

6

GATE CSE 2022 | Question: 18
Suppose a binary search tree with $1000$ distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with $0,$ the $3^{\text{rd}}$ largest element of the tree is stored at index ______________ .

Arjun asked in DS Feb 15, 2022

by Arjun

6.6k views

Page:

1
2
3
4
5
6
...
8
next »

Recent questions tagged binary-search-tree