Will Sloan xanarin
This file contains 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
| #!/usr/bin/env python3 | |
| import argparse | |
| import random | |
| import sys | |
| def gen_key(): | |
| random.seed() | |
| key = "" | |
| for idx in range(32): | |
| key += hex(random.randrange(0, 16)).upper()[-1] |
xanarin
/ treeMatcher.go
Last active
September 16, 2016 02:20
An extension on the Equivalent Binary Trees - (https://tour.golang.org/concurrency/8) exercise from the Tour of Go Example on Goroutines - (https://tour.golang.org/concurrency/1).
This file contains 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 "golang.org/x/tour/tree" | |
| import "fmt" | |
| // Walk walks the tree t sending all values | |
| // from the tree to the channel ch. | |
| func Walk(t *tree.Tree, ch chan int) { | |
| // Recursive Approach | |
| if (t.Left != nil) { |