Re: Other tree representations in SQL
Date: 5 Dec 2002 11:09:03 -0800
Message-ID: <c0d87ec0.0212051109.715c352f_at_posting.google.com>
>> I'm still working on the solution when representing binary trees
with
(inorder_traversal_sequence_number, level) <<
I cannot send my manuscript to my publisher untilyou finish doing all my work for me :)
>>... representation of binary trees when each node is represented with the number (index) according to the following scheme: <<
I have seen a binary tree representation done as a string of 0's and 1's, where each left or right turn in a traversal down the tree concatenates another 0 or 1 to the string.
Your method requires that you also have some idea of the greatest depth of the tree. However, adding new nodes and subtrees looks very easy -- just more algebra. I have to play with this more. Received on Thu Dec 05 2002 - 20:09:03 CET