Complete the function isFull() to take in a root node of a tree and return True if the tree is full, False otherwise.

A binary tree is considered full if all nodes have either 2 or 0 children (i.e. no node has only one child). In other words, a binary tree is full if all non-leaf nodes have exactly 2 children.