Data Structures & Algorithms In Go/

...

/

Solution Review: Identical Trees

Solution Review: Identical Trees

Let’s take a detailed look at the previous challenge’s solution.

We'll cover the following...

Solution

The two trees are said to have identical values if, at each level, the values in their respective nodes are equal.

Solution code

Press + to interact
Go (1.6.2)
Files
package main
import "fmt"
func (t *Tree) IsEqual(t2 *Tree) bool {
    return isEqual(t.root, t2.root)
}
func isEqual(node1 *Node, node2 *Node) bool {
    if node1 == nil && node2 == nil {
        return true
    } else if node1 == nil || node2 == nil {
        return false
    } else {
        return ((node1.value == node2.value) &&
        isEqual(node1.left, node2.left) &&
        isEqual(node1.right, node2.right))
    }
}
/* Testing Code */
func main() {
    arr := []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
    t := LevelOrderBinaryTree(arr)
    t2 := LevelOrderBinaryTree(arr)
    fmt.Println(t.IsEqual(t2))
}

Complexity analysis

The time and space complexity of this solution is ...