(TreeNode node)
| 26 | return diameter-1; |
| 27 | } |
| 28 | int height(TreeNode node) { |
| 29 | if(node == null) { |
| 30 | return 0; |
| 31 | } |
| 32 | |
| 33 | int leftHeight = height(node.left); |
| 34 | int rightHeight = height(node.right); |
| 35 | |
| 36 | int dia = leftHeight + rightHeight + 1; |
| 37 | diameter = Math.max(diameter, dia); |
| 38 | |
| 39 | return Math.max(leftHeight, rightHeight) + 1; |
| 40 | |
| 41 | } |
| 42 | |
| 43 | |
| 44 | public TreeNode invertTree(TreeNode root) { |
no test coverage detected