please explain how you got their

Rowan University Computer Science DAA -Dr. Andrea F. Lobo Practice: Proofs by Induction The height of a tree is the longest path from its root to a leaf. A tree with single node (this node is the tree's root and also its only leaf) has a height of 0. A complete binary tree with three nodes (a root and its two leaves) has a height of 1. In general, a binary tree t has height (t) max height (t.left), height (t.right1 . Draw the shape of a complete binary tree of height 0 (a single node 1. Draw the shape of a complete binary tree of height 1. 2. Draw the shape of a complete binary tree of height 2. . Draw the shape of a complete binary tree of height 3