Balanced Binary Tree

# Introduction

In this challenge, we will be implementing a function called `isBalanced`. This function will take a binary tree as input and determine if the tree is height balanced. A height balanced binary tree is defined as a binary tree in which the left and right subtrees of every node differ in height by no more than 1. We will be provided with example binary trees where we need to determine if they are height balanced or not.