getLeftmost(node = this.root) {
    if (!node || !node.left) {
      return node;
    }
    return this.getMin(node.left);
  }
Get the node with the min value of subtree: the left-most value.
@param {BinaryTreeNode} node subtree's root
@returns {BinaryTreeNode} left-most node (min value)