Function isSymmetricWrong

symmetric_tree_101/solution.go:39–55

Based on in-order traversal being a palindrome. Wrong approach but good lesson on array appending in recursive function.

(root *TreeNode)

// Based on in-order traversal being a palindrome.
// Wrong approach but good lesson on array appending in recursive function.
func isSymmetricWrong(root *TreeNode) bool {
	inOrder := make([]int, 0)
	inOrder = inorderTraverse(root, inOrder)

	i := 0
	j := len(inOrder) - 1
	for i < j {
		if inOrder[i] != inOrder[j] {
			return false
		}

		i++
		j--
	}

	return true
}

func inorderTraverse(root *TreeNode, a []int) []int {
	if root == nil {