PL/SQL :: Path Between Two Siblings Node

I want to find the path between two nodes from oracle Hierarchical Table.

Consider the following case ---
NodeId --- ParentId
=============
1 >>>>>> 0
2 >>>>>> 1
3 >>>>>> 2
4 >>>>>> 3
5 >>>>>> 0
6 >>>>>> 5

Here I want to query in the database table that whether there is a path between node 3 and node 5 ? The previous query you provided work up to root node.

Here my expected result is 3-->2-->1-->0-->5

Again if I query in the table to get the path between 1 and 3 , I want to get the output in the following way -
1-->2-->3

So the query need to work in both the cases. Where root nod can act as an intermediate node or not.

how I can get it ?