A
AD
Hi,
I know it is not exactly a C++ problem but rather concerns algorithm.
But I could not figure out any other group to post this so am posting
here.
I am looking for the algorithm proposed by Morris for inorder traversal
of a Binary Tree without using explicit stack. Searched on net but
could not find many clues.
This was the nearest I could reach:
https://www.cs.tcd.ie/research_groups/fmg/IFMSIG/winter2000/HughGibbonsSlides.pdf
Anybody with a better idea?
thanks & regds
AD
I know it is not exactly a C++ problem but rather concerns algorithm.
But I could not figure out any other group to post this so am posting
here.
I am looking for the algorithm proposed by Morris for inorder traversal
of a Binary Tree without using explicit stack. Searched on net but
could not find many clues.
This was the nearest I could reach:
https://www.cs.tcd.ie/research_groups/fmg/IFMSIG/winter2000/HughGibbonsSlides.pdf
Anybody with a better idea?
thanks & regds
AD