z-logo
open-access-imgOpen Access
The Expected Distribution of Degrees in Random Binary Search Trees
Author(s) -
Hosam M. Mahmoud
Publication year - 1986
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/29.1.36
Subject(s) - combinatorics , random binary tree , binary search tree , mathematics , tree (set theory) , set (abstract data type) , binary tree , path (computing) , binary number , optimal binary search tree , distribution (mathematics) , self balancing binary search tree , ternary search tree , degree (music) , discrete mathematics , computer science , k ary tree , interval tree , tree structure , physics , arithmetic , mathematical analysis , acoustics , programming language
Etude de la distribution moyenne des degres des sommets dans un arbre de recherche binaire aleatoire

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom