Autor:	Ezzat Mohammad Nezhad, Mehri Javanian, Ramin Imany Nabiyyi
Rok vydání:	2022
Předmět:	General Mathematics Software Computer Science Applications
Zdroj:	RAIRO - Theoretical Informatics and Applications. 56:2
ISSN:	2804-7346 0988-3754
Popis:	Here, we derive the exact mean and variance of the number of weakly protected nodes (the nodes that are not leaves and at least one of their children is not a leaf) in binary search trees grown from random permutations. Furthermore, by using contraction method, we prove normal limit law for a properly normalized version of this tree parameter.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::7a3b73564fa7f7e2502a95276aebbb35 https://doi.org/10.1051/ita/2022002 Zobrazit plný text záznamu