atoomix
atoomix
/ Equivalent Binary Trees.go
Created
October 22, 2022 10:39
A Tour of Go - Exercise Equivalent Binary Trees
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package main | |
| import ( | |
| "fmt" | |
| "golang.org/x/tour/tree" | |
| ) | |
| // Walk walks the tree t sending all values | |
| // from the tree to the channel ch. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package main | |
| import ( | |
| "io" | |
| "os" | |
| "strings" | |
| ) | |
| var upper_dict = []byte("NOPQRSTUVWXYZABCDEFGHIJKLM") | |
| var lower_dict = []byte("nopqrstuvwxyzabcdefghijklm") |