You are viewing a single comment's thread. Return to all comments →
From my HackerRank solutions.
void postOrder(Node n) { if (n != null) { postOrder(n.left); postOrder(n.right); System.out.print(n.data + " "); } }
Let me know if you have any questions.
Seems like cookies are disabled on this browser, please enable them to open this website
Tree: Postorder Traversal
You are viewing a single comment's thread. Return to all comments →
Java solution - passes 100% of test cases
From my HackerRank solutions.
Let me know if you have any questions.