DECODING AND DRAWING ON BSR FOR A BINARY TREE FROM ITS i-p SEQUENCE
Limin Xiang, Kazuo Ushijima · Parallel Processing Letters · 1999
The i-p sequence is one of the most common encodings for a binary tree. This paper gives constant time BSR parallel algorithms for the decoding and drawing of a binary tree from its i-p sequence respectively.