Before revision: In this paper, we bring together both the paradigms to develop an algorithm that morphs(n) morphing steps and sometimes \Omega(n) steps is necessary even when G is a path~}[ (\log n) for an n-vertex tree }[ [  between two planar straight-line grid drawings of an n-vertex tree T in sublinear number of morphing steps such that each intermediate morphing step produces a 3D straight-line crossing free grid drawing of T while maintaining the resolution.
After revision: In this paper, we bring together both the paradigms to develop an algorithm that morphs(n) morphing steps and sometimes \Omega(n) steps is necessary even when G is a path~}[ , while using 3D can reduce the number of steps to \mathcal{O(\log n) for an n-vertex tree }[ [ between two planar straight-line grid drawings of an n-vertex tree T in sublinear number of morphing steps such that each intermediate morphing step produces a 3D straight-line crossing free grid drawing of T while maintaining the resolution.