The pre-order scan output of a character binary tree (not a binary search tree) produced A D F G H K L P Q R W Z and the in-order scan output of the same binary tree produced G F H K D L A W R Q P Z Draw the binary tree. The postorder scan output of a character binary tree (not a binary search tree) produced F G H D A L P Q R Z W K and the in-order scan output of the same binary tree produced the same output as in the previous question. Draw the binary tree