given the following binary search tree in which the letters are labels, not values:

B. Given the following binary search tree in Which the letters are labels not Show tix traversal Output When applying I) post-order algorithm is applied 2) in-order algorithm is applied