converting Binary Tree from sequential representation to linked representtion

[tdeluce]

Does anyone have an efficient way of doing this.

I just want to maintain the structure of the sequential representation in the linked representation - this is not a binary search tree, i.e. the node values are random...