Let S be a set of n points in the plane that is in convex position. For a real number t > 1, we say that a point p in S is t-good if for every point q of S, the shortest-path distance between p and qâ€¦ (More)

An AVL tree [1] is the original type of balanced binary search tree. An insertion in an n-node AVL tree takes at most two rotations, but a deletion in an n-node AVL tree can take Î˜(log n). A naturalâ€¦ (More)

We study the problem of generating, ranking and unranking of unlabeled ordered trees whose nodes have maximum degree of âˆ†. This class of trees represents a generalization of chemical trees. Aâ€¦ (More)

In this thesis, new properties of AVL trees and a new partitioning of binary search trees named core partitioning scheme are discussed, this scheme is applied to three binary search trees namely AVLâ€¦ (More)