Pages that link to "Item:Q4449502"
From MaRDI portal
The following pages link to An almost sure result for path lengths in binary search trees (Q4449502):
Displaying 7 items.
- Expected conflicts in pairs of rooted binary trees (Q381179) (← links)
- An extended result of Kleitman and Saks concerning binary trees (Q1060017) (← links)
- On the joint distribution of the insertion path length and the number of comparisons in search trees (Q1121028) (← links)
- EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES (Q3430661) (← links)
- On the path length of binary trees (Q3829055) (← links)
- Tight Upper and Lower Bounds on the Path Length of Binary Trees (Q4286225) (← links)
- A \(q\)-analogue of the path length of binary search trees (Q5953109) (← links)