An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

07/01/2020
by   Peyman Nasehpour, Ph.D., et al.
0

In this paper, we present InPos, an improved algorithm, to reconstruct a binary tree from its inorder and postorder traversals.

READ FULL TEXT

page 4

page 6

page 7

page 9

page 16

page 17

page 18

page 19

research
07/01/2020

A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals

Binary trees are essential structures in Computer Science. The leaf (lea...
research
02/02/2020

Caterpillars on three and four leaves are sufficient to reconstruct normal networks

While every rooted binary phylogenetic tree is determined by its set of ...
research
10/25/2022

Eigen Memory Tree

This work introduces the Eigen Memory Tree (EMT), a novel online memory ...
research
03/17/2023

A Comparison of Dijkstra's Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees

This paper describes the shortest path problem in weighted graphs and ex...
research
11/24/2018

Divergence Prior and Vessel-tree Reconstruction

We propose a new geometric regularization principle for reconstructing v...
research
11/20/2019

Faster Dynamic Compressed d-ary Relations

The k^2-tree is a successful compact representation of binary relations ...
research
12/09/2019

Combining Networks using Cherry Picking Sequences

Phylogenetic networks are important for the study of evolution. The numb...

Please sign up or login with your details

Forgot password? Click here to reset