Assertion: tree's node | /r/HasProperty | unlikely to have the same priority
Facets:
value: very
type: DEGREE
Source sentences:
text: Therefore, if the priorities are independent random numbers (from a distribution over a large enough space of possible priorities to ensure that two nodes are very unlikely to have the same priority) then the shape of a treap has the same probability distribution as the shape of a random binary search tree, a search tree formed by inserting the nodes without rebalancing in a randomly chosen insertion order.