Golang Leetcode 530. Minimum Absolute Difference in BST.go

思路

中序遍历

code

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

var st []int

func inorder(root *TreeNode) {
	if root == nil {
		return
	}
	if root.Left != nil {
		inorder(root.Left)
	}
	if root != nil {
		st = append(st, root.Val)
	}
	if root.Right != nil {
		inorder(root.Right)
	}
}

func getMinimumDifference(root *TreeNode) int {
	st = make([]int, 0, 256)
	inorder(root)
	ret := math.MaxInt32
	for i := 1; i < len(st); i++ {
		if (st[i] - st[i-1]) < ret {
			ret = st[i] - st[i-1]
		}
	}
	return ret
}

更多内容请移步我的repo：https://github.com/anakin/golang-leetcode