3. Binary tree 25 points (a) 15 pts Assume a binary tree with each node containing one integer, and its left child storing a number smaller or equal to the current node (parent) and its right child storing a larger number. Draw a binary tree structure that stores the following list of integers, and list the tree in post-order. 57, 82, 48, 39, 21, 90, 22, 32, 78, 91, 24, 48 Binary search tree