Question1:
Implement method to calculate x to the power of n: https://leetcode.com/problems/powx-n/

Question 2:
Given a target node in a BST, find the predecessor node. Note: not the parent note, but the next smallest value in the BST.