Reverse Traversal of a Binary Tree

This is a simple Java program to demonstrate how to perform a reverse traversal of a binary tree. In this project, I've written code for both post order and in order reverse traversals.

---

Input

50
├──25
│  ├──10
│  └──40
└──75
   ├──60
   └──80
---------------------

---

Output

Reverse Post Order Traversal
80 60 75 40 10 25 50 
---------------------
Reverse In Order Traversal
80 75 60 50 40 25 10 
---------------------