(TreeNode root)
| 32 | } |
| 33 | |
| 34 | private int height(TreeNode root){ |
| 35 | // calculate the height of a tree |
| 36 | if(root == null){ |
| 37 | return 0; |
| 38 | } |
| 39 | else{ |
| 40 | int left = height(root.left); |
| 41 | int right = height(root.right); |
| 42 | int height = left > right ? left : right; |
| 43 | return height + 1; |
| 44 | } |
| 45 | } |
| 46 | } |