Prove, by induction on the height, h that any s-tree has an odd number of nodes (recall that a number is odd if it can be written as 2x + 1 for some integer x). Dont forget to include the BC, IH, and IS.

A green node has 2 children. A black node has no children.