The binary search tree or Quicksort is the most used of all sorting algorithm, since it is both fast and simple. The random recursive tree is another extensively studied random tree. We have examined fringe trees in these two types of random trees, since the study of such subtrees appears to be an effective approach towards defining characteristics also of the whole tree. By using a representat...