JSTOR Daily

ON TAIL BOUNDS FOR RANDOM RECURSIVE TREES

We consider a multivariate distributional recursion of sum type, as arises in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's ...
JSTOR Daily

A Necessary and Sufficient Condition for the Tail-Triviality of a Recursive Tree Process

This is a preview. Log in through your library . Abstract Given a recursive distributional equation (RDE) and a solution μ of it, we consider the tree indexed invariant process called the recursive ...
adtmag.com

Iteration over a sorted binary tree using recursive descent in an enumeration method.

Listing 1. Iteration over a sorted binary tree using recursive descent in an enumeration method. public interface KeyValueTask { void apply(String key, String value ...
Ars Technica

Nonrecursive preorder traversal of a binary tree?

Is there any way to implement a nonrecursive preorder traversal of a binary tree without using a stack? In a standalone function?<P>the recursive preorder looks like ...