For example draw a binary Tree for the expression:
A * B - (C + D) * (P / Q)
I hope you just want the representation -
- / \ * * / \ / \ a b + / / \ / \ c D P Q
How to find longest consecutive path in a binary tree using C/C++/Java?
How to traverse a binary search tree diagonally? Any sample algo/code?