A Note on the Expected Path Length of Trees with Known Fringe
نویسندگان
چکیده
The path length of a tree, that is the sum of the lengths of all root-leaf paths, is an important measure of eeciency of the tree. The fringe of a tree is the diierence between the lengths of the longest path and the shortest path in the tree. The minimal and the maximal path length of trees with N leaves and given fringe have been well studied. In this paper, we initiate the study of the expected path length of the class of trees with N leaves and fringe by giving a closed expression for the expected path length when = 2.
منابع مشابه
Minimal Path Length of Trees with Known Fringe
In this paper we continue the study of the path length of trees with known fringe as initiated by 1] and 2]. We compute the path length of the minimal tree with given number of leaves N and fringe for the case N=2. This complements the result of 2] that studied the case N=2. Our methods also yields a linear time algorithm for constructing the minimal tree when N=2.
متن کاملThe Maximal Path Length of Binary Trees
We further refine the bounds on the path length of binary trees of a given size by considering not only the size of a binary tree, but also its height and fringe thickness (the difference between the length of a shortest root-to-leaf path and the height). We characterize the maximum path length binary trees of a given height, size, and fringe thickness. Using this characterization, we give an a...
متن کاملFringe Analysis of 2-3 Trees with Lazy Parent Split Fringe Analysis of 2-3 Trees with Lazy Parent Split
In B-trees with Lazy Parent Split (LPS) parent splits are postponed until a future access of the latter node. This way, the number of splits during an insert is decreased and the number of locks is also decreased. Consequently, better concurrency is achieved. In this paper we study 2-3 trees with LPS. We use fringe analysis to obtain bounds on some performance measures of 2-3 trees with LPS. Th...
متن کاملNote on the Weighted Internal Path Length of b-ary Trees
In a recent paper Broutin and Devroye (2005) have studied the height of a class of edge-weighted random trees. This is a class of trees growing in continuous time which includes many well known trees as examples. In this paper we derive a limit theorem for the internal path length for this class of trees. The application of this limit theorem to concrete examples depends upon the possibility to...
متن کاملFringe Analysis of 2-3 Trees with Lazy Parent Split
B-trees with lazy parent split (lps) are B-tree variants, according to which parent splits are postponed until a future access of the latter node. This way, the number of splits during an insert is decreased and the number of locks is also decreased. Consequently, better concurrency is achieved. In this paper 2–3 trees with lps are studied. Fringe analysis is used to obtain bounds on some perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 59 شماره
صفحات -
تاریخ انتشار 1996