پیوندهای مفید
آمار
| تعداد نشریات | 11 |
| تعداد شمارهها | 234 |
| تعداد مقالات | 2,383 |
| تعداد مشاهده مقاله | 3,802,699 |
| تعداد دریافت فایل اصل مقاله | 2,763,655 |
Path length of protected nodes in random binary search trees | ||
| Journal of Discrete Mathematics and Its Applications | ||
| مقاله 2، دوره 10، شماره 4، اسفند 2025، صفحه 321-332 اصل مقاله (365.79 K) | ||
| نوع مقاله: Full Length Article | ||
| شناسه دیجیتال (DOI): 10.22061/jdma.2025.12370.1151 | ||
| نویسندگان | ||
| Ramin Kazemi* ؛ Sedigheh Zamani Mehreyan | ||
| Department of Statistics, Faculty of Science, Imam Khomeini International University, Qazvin, I. R. Iran | ||
| تاریخ دریافت: 18 مرداد 1404، تاریخ بازنگری: 29 مرداد 1404، تاریخ پذیرش: 07 آذر 1404 | ||
| چکیده | ||
| A protected node is a node that is not a leaf and none of its children is a leaf, and also a weakly protected node is not a leaf and at least one of its children is not a leaf. Let Pn and Wn be the path length of the protected and weakly protected nodes in a random binary search tree (BST) of size n, respectively. In this paper, we derive the exact mean and variance of these random variables and show that $$\frac{15 Pn}{11n\ln n}\to 1$$ and $$\frac{15W_n}{14n\ln n}\to 1$$ in probability. | ||
| کلیدواژهها | ||
| Binary search trees؛ path length؛ protected node؛ weakly protected node؛ limiting rule | ||
|
آمار تعداد مشاهده مقاله: 351 تعداد دریافت فایل اصل مقاله: 371 |
||