Analysis Of Algorithms University of Bridgeport Analysis of Algorithms
Download
3.4 Mb.
Page
29/33
Date
28.05.2018
Size
3.4 Mb.
#51061
1
...
25
26
27
28
29
30
31
32
33
=
(proof in handout: ‘Mathematical Tools’, Page 4)
Substituting this
value in the equation above
, we have
[since n = 2
k
– 1]
Thus,
Average Depth of full BST Node =
The following table shows some actual values of average depths of BST nodes for given values of k:
Download
3.4 Mb.
Share with your friends:
1
...
25
26
27
28
29
30
31
32
33
The database is protected by copyright ©ininet.org 2024
send message
Main page
same amount
= 
(proof in handout: ‘Mathematical Tools’, Page 4)
[since n = 2k – 1]
