On Fri, 1 Dec 2000, Ketan Mehta wrote: > In-order traversal is root , left , right. > BFS - has to be implemented by queue yeah thats what i tried to explain in the mail with the tree ABCDE. But back to the actual intent, can one use btree( ) of the db package for this , or has anyone used it. sreangsu