1. If the root is null, return 0. 2. Find the height of the left subtree by calling findHeight(root.left). 3. Find the height of the right subtree by calling findHeight(root.right) 4. Compare the two heights and return the maximum of the two (after adding 1 to account for the root node).