On May 23, 2:25 am, Vinodh <[EMAIL PROTECTED]> wrote: > For traversing binary trees there are standard ways like, > - In order > - Pre Order > - Post Order > > Questions Are: > The construction of the data as a binary tree is upto us. Am I right? > (I read somewhere 2n-n combinations are possible) > > Is there any thing like it should be always ordered or sorted? > > Just to validate my understanding, making data into binary tree format > helps us in traversing, sometimes treating data in binary tree format > is natural. Am I right? > > Why In Donald Knuth's TAOCP Vol1 he says the binary trees dealt there > are ordered tress? Is there any significance for ordered trees?
Yes! There are several useful orders for binary trees. Two of the most useful are in-order sorted, which produces "binary search trees" (BSTs). Google for details. Another is trees ordered with the "Heap property." Google for "heap data structure." There are others. For fun try "trie" or "prefix tree". --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
