Assume each node in your tree is implemented using the class BinaryNode, which implements the following binary node functions discussed in the videos and textbook (and only the following functions). +getItem(): integer +isLeaf (): boolean +getLeftChildPtr(): BinaryNode* +getRightChildPtr(): BinaryNode* // nodePtr: pointer to the root node of tree to check int lefties (BinaryNode* nodePtr)