• English
    • العربية
  • العربية
  • Login
  • QU
  • QU Library
  •  Home
  • Communities & Collections
  • Help
    • Item Submission
    • Publisher policies
    • User guides
    • FAQs
  • About QSpace
    • Vision & Mission
    • QSpace policies
View Item 
  •   Qatar University Digital Hub
  • Qatar University Institutional Repository
  • Academic
  • University Publications
  • QU Ceased Journals
  • Qatar University Science Journal - [From 1981 TO 2007]
  • View Item
  • Qatar University Digital Hub
  • Qatar University Institutional Repository
  • Academic
  • University Publications
  • QU Ceased Journals
  • Qatar University Science Journal - [From 1981 TO 2007]
  • View Item
  •      
  •  
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    A Random Binary Trees Generation Method

    Thumbnail
    View/Open
    A random binary trees generation method.pdf (415.0Kb)
    Date
    2000
    Author
    Maghrabi, Saud M.A. [سعود محمد عبد الله مغربي]
    Metadata
    Show full item record
    Abstract
    There are two widely used random distributions on binary trees, namely the binary search tree distribution and the uniform distribution. By analyzing the performance of algorithms that manipulate binary trees generated at random, it is possible to assess the average case performance of the algorithm. This average case performance is often a more useful reflection of the algorithm's suitability than the worst-case performance. An algorithm may have a worst-case run time that is of exponential time complexity, but an average-case run time that is of polynomial time complexity. In such cases, one wishes to assess the performance of an algorithm on a 'typical' range of tree structures and thus relate properties of randomly generated trees, such as depth, to aspects affecting the algorithm's run-time. The purpose of this paper is to design and implement a random binary trees generation algorithm that considers the average case performance. The algorithm is differ from both the uniform distribution and the binary search tree distribution. Analysis of the behaviour of the algorithm is given.
    DOI/handle
    http://hdl.handle.net/10576/9747
    Collections
    • Qatar University Science Journal - [From 1981 TO 2007] [‎770‎ items ]

    entitlement


    Qatar University Digital Hub is a digital collection operated and maintained by the Qatar University Library and supported by the ITS department

    Contact Us | Send Feedback
    Contact Us | Send Feedback | QU

     

     

    Home

    Submit your QU affiliated work

    Browse

    All of Digital Hub
      Communities & Collections Publication Date Author Title Subject Type Language Publisher
    This Collection
      Publication Date Author Title Subject Type Language Publisher

    My Account

    Login

    Statistics

    View Usage Statistics

    About QSpace

    Vision & Mission QSpace policies

    Help

    Item Submission Publisher policiesUser guides FAQs

    Qatar University Digital Hub is a digital collection operated and maintained by the Qatar University Library and supported by the ITS department

    Contact Us | Send Feedback
    Contact Us | Send Feedback | QU

     

     

    Video