Tree is just a data structure.. so if its an array implementation(considering binary tree), siblings are adjancent elements anyways..
Also, if its a linked represntation then u can just add another field for parent..like some of the traversal algorithms use. Also, we can use Threaded binary tree representation, which stores the inorder successor and a slight effort will give us the sibling in constant time. NUPUL wrote: > >I was wondering if there is any >method to link all sibling nodes >in a > >binary tree > > i suggest you read up something on B trees and B+ trees and then put > forth this question. > > Nupul --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
