DevX Home    Today's Headlines   Articles Archive   Tip Bank   Forums   

Results 1 to 8 of 8

Thread: AA Tree Implementation Variation and Concepts

Threaded View

  1. #1
    Join Date
    May 2007
    Posts
    843

    Thumbs up AA Tree Implementation Variation and Concepts

    Hello to all expect pogrammer, i wonder there are how many methods of AA Tree implmentation.

    AFAIK, some using link[2], [0] = left and [1] = right and leftNode or rightNode.

    Which one is easier and better ?

    Some balanced tree contain level in its node and some are not. Please clarify on this.

    I did a huge amount of research but not really understand it.

    I know that AA Tree is a 2-3 tree which means

    If a node contains 1 data, then got two children.
    If a node contains 2 data, then got three children.

    Besides that, AA Tree also doesn't have red node at left child. How this can coded in programming ? What this means ?

    Skew = right notation
    split = left rotation and increase root level

    Every leaf node has level 1.


    I hope you all can help me out.


    Thanks for your help.
    Last edited by Peter_APIIT; 11-01-2008 at 03:33 AM.

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  
HTML5 Development Center
 
 
FAQ
Latest Articles
Java
.NET
XML
Database
Enterprise
Questions? Contact us.
C++
Web Development
Wireless
Latest Tips
Open Source


   Development Centers

   -- Android Development Center
   -- Cloud Development Project Center
   -- HTML5 Development Center
   -- Windows Mobile Development Center