題目:
樹節點的結構爲:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
求每個節點的高度,並保存在節點的val中
代碼:
public int height(TreeNode root) {
if(root == null) {
return 0;
}
root.val = Math.max(height(root.left), height(root.right)) + 1;
return root.val;
}