I am reading the tour of Go, it has a problem of equivalent binary tree. The article said A function to check whether two binary trees store the same sequence is quite complex in most languages.
https://tour.golang.org/concurrency/7
I am a little confused, could we just use any traversal method like inorder traversal the tree and verify the resulted sequence is same. I think it is pretty simple. Anyone could let me know if my understanding is wrong?