Random binary tree

Known as: Random binary search tree

In computer science and probability theory, a random binary tree refers to a binary tree selected at random from some probability distribution on…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

This work is a case study of the formal verification and complexity analysis of some famous probabilistic algorithms and data…

2014

2010

Expanding mental outlook for learners is one of the important open problems in e-Learning. Online should have the property of…

2008

Concept maps are an effective way of representing organized knowledge (concepts) in hierarchical fashion regarding a person’s…

2006

We consider weighted path lengths to the extremal leaves in a random binary search tree. When linearly scaled, the weighted path…

2004

For the random binary search tree with n nodes inserted the number of ancestors of the elements with ranks k and $\ell$, $1 \le k…

2003

Constructing a random binary search tree with n nodes needs /spl theta/(nlog n) time on RAM, and /spl omega/(log n) time on n…

2002

We present a performance comparison of tree data structures for N-body simulation. The tree data structures examined are the…

2002

Note that k must always equal i+ 1 in a binary tree. Prodinger [P] recently computed the probability that a random binary tree…

1975

SummaryWhen searching unsuccessfully for a fixed element in a random binary search tree, the number of comparisons made whose…