The Gateway to Computer Science Excellence

UGCNET-Sep2013-III-41

+2 votes
2k views

Given a binary search trees for a set of n=5 keys with the following probabilities:

i 0 1 2 3 4 5
$p_i$ - 0.15 0.10 0.5 0.10 0.20
$q_i$ 0.05 0.10 0.05 0.05 0.05 0.10

The expected optimal cost of the search is

  1. 2.65
  2. 2.70
  3. 2.75
  4. 2.80
in DS by Veteran (105k points) | 2k views
+1
Is the answer 2.75
by Veteran (50.9k points)
0

@  Veteran Kindly explain how u have calculated

by Active (3.2k points)

2 Answers

+2 votes
by Veteran (431k points)
0

arjun sir,how to calculate depth(Ki) or depth(di) here..??as we are not given BST

by Boss (12.2k points)
edited by
0
Can you please provide PDF. The link is not working
by Active (3.2k points)
0
Link not Working!
by (127 points)
0 votes
How??
by Active (4.8k points)
0
plz explain how to calculate
by Active (3.8k points)
← Prev. Qn. in Sub. Next Qn. in Sub. →
← Prev. Next →
Answer:

Related questions

Quick search syntax
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
50,737 questions
57,309 answers
198,337 comments
105,023 users