refactor Balanced Binary Tree

Author: rihib

go/balanced_binary_tree.go

@@ -3,7 +3,7 @@ package main
 
 import "math"
 
-type TreeBalance struct {
+type treeBalance struct {
 	isBalanced bool
 	height     int
 }
@@ -12,13 +12,13 @@ func isBalanced(root *TreeNode) bool {
 	return checkBalance(root).isBalanced
 }
 
-func checkBalance(root *TreeNode) *TreeBalance {
+func checkBalance(root *TreeNode) treeBalance {
 	if root == nil {
-		return &TreeBalance{true, 0}
+		return treeBalance{true, 0}
 	}
 	left, right := checkBalance(root.Left), checkBalance(root.Right)
 	isBalanced := left.isBalanced && right.isBalanced &&
 		math.Abs(float64(left.height-right.height)) <= 1.0
 	height := max(left.height, right.height) + 1
-	return &TreeBalance{isBalanced, height}
+	return treeBalance{isBalanced, height}
 }