Leetcode Golang 110. Balanced Binary Tree.go

type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

func isBalanced(root *TreeNode) bool {
	if root == nil {
		return true
	}

	l := getHeight(root.Left)
	r := getHeight(root.Right)
	return l-r < 2 && r-l < 2 && isBalanced(root.Left) && isBalanced(root.Right)
}

func getHeight(root *TreeNode) int {

	if root == nil {
		return 0
	}

	return mymax(getHeight(root.Left), getHeight(root.Right)) + 1
}
func mymax(x, y int) int {
	if x > y {
		return x
	}
	return y
}