Pages that link to "Item:Q3829055"
From MaRDI portal
The following pages link to On the path length of binary trees (Q3829055):
Displaying 23 items.
- Mean deep coalescence cost under exchangeable probability distributions (Q400512) (← links)
- Minimal path length of trees with known fringe (Q673649) (← links)
- Characteristic inequalities for binary trees (Q674183) (← links)
- On the number of \(t\)-ary trees with a given path length (Q866964) (← links)
- A tight upper bound for the path length of AVL trees (Q912600) (← links)
- Path length and height in asymmetric binary branching trees (Q933215) (← links)
- On Postnikov's hook length formula for binary trees (Q942125) (← links)
- Binary trees and uniform distribution of traffic cutback (Q1076523) (← links)
- A note on the path length of red-black trees (Q1198079) (← links)
- Fringe thickness and maximum path length of binary trees (Q1281386) (← links)
- Maximal path length of binary trees (Q1337670) (← links)
- Balance in AVL trees and space cost of brother trees (Q1342232) (← links)
- A note on the expected path length of trees with known fringe (Q1350914) (← links)
- Extremal values of the Sackin tree balance index (Q2033483) (← links)
- An \(O(n \log n)\) time algorithm for computing the path-length distance between trees (Q2319639) (← links)
- (Q3495379) (← links)
- On the structure of paths-like trees (Q3606453) (← links)
- On the average length of lexicographic paths (Q3735459) (← links)
- Tight Upper and Lower Bounds on the Path Length of Binary Trees (Q4286225) (← links)
- (Q4346817) (← links)
- Binary trees, fringe thickness and minimum path length (Q4850323) (← links)
- ON WEIGHTED PATH LENGTHS AND DISTANCES IN INCREASING TREES (Q5422219) (← links)
- Optimal binary search trees (Q5906917) (← links)
