C++ implementation of a Binary Expression Tree (BET) for converting postfix expressions to infix. Includes recursive algorithms, Makefile, test cases, and complexity analysis. The project aims to strengthen skills in binary trees and recursion, fulfilling the ABET assessment requirement.