Naveen Gabrani - Academia.edu (original) (raw)

Uploads

Papers by Naveen Gabrani

Research paper thumbnail of A note on the reconstruction of a binary tree from its traversals

Information Processing Letters, 1992

Gabrani, N. and P. Shankar, A note on the reconstruction of a binary tree from its traversals, In... more Gabrani, N. and P. Shankar, A note on the reconstruction of a binary tree from its traversals, Information Processing Letters 42 (1992) 117-119. We present a linear-time sequential algorithm for the construction of a binary tree, given its preorder and inorder traversals. The algorithm leads to an optimal O(log n) time parallel algorithm on the EREW PRAM model, where n is the number of nodes in the tree.

Research paper thumbnail of A Note on the Reconstruction of a Binary Tree from its Traversals

Information Processing Letters, 1992

Gabrani, N. and P. Shankar, A note on the reconstruction of a binary tree from its traversals, In... more Gabrani, N. and P. Shankar, A note on the reconstruction of a binary tree from its traversals, Information Processing Letters 42 (1992) 117-119. We present a linear-time sequential algorithm for the construction of a binary tree, given its preorder and inorder traversals. The algorithm leads to an optimal O(log n) time parallel algorithm on the EREW PRAM model, where n is the number of nodes in the tree.

Research paper thumbnail of A note on the reconstruction of a binary tree from its traversals

Information Processing Letters, 1992

Gabrani, N. and P. Shankar, A note on the reconstruction of a binary tree from its traversals, In... more Gabrani, N. and P. Shankar, A note on the reconstruction of a binary tree from its traversals, Information Processing Letters 42 (1992) 117-119. We present a linear-time sequential algorithm for the construction of a binary tree, given its preorder and inorder traversals. The algorithm leads to an optimal O(log n) time parallel algorithm on the EREW PRAM model, where n is the number of nodes in the tree.

Research paper thumbnail of A Note on the Reconstruction of a Binary Tree from its Traversals

Information Processing Letters, 1992

Gabrani, N. and P. Shankar, A note on the reconstruction of a binary tree from its traversals, In... more Gabrani, N. and P. Shankar, A note on the reconstruction of a binary tree from its traversals, Information Processing Letters 42 (1992) 117-119. We present a linear-time sequential algorithm for the construction of a binary tree, given its preorder and inorder traversals. The algorithm leads to an optimal O(log n) time parallel algorithm on the EREW PRAM model, where n is the number of nodes in the tree.

Log In