Logo

Programming-Idioms

History of Idiom 9 > diff from v10 to v11

Edit summary for version 11 by :
↷

Version 10

2015-09-13, 17:11:16

Version 11

2015-09-13, 17:48:09

Idiom #9 Create a Binary Tree data structure

The structure must be recursive because left child and right child are binary trees too. A node has access to children nodes, but not to its parent.

Idiom #9 Create a Binary Tree data structure

The structure must be recursive because left child and right child are binary trees too. A node has access to children nodes, but not to its parent.

Code 
type BinTree struct {
	Key keyType
	Deco valueType
	Left *BinTree
	Right *BinTree
}
Code 
type BinTree struct {
	Key keyType
	Deco valueType
	Left *BinTree
	Right *BinTree
}
Comments bubble
keyType should be easily comparable.
valueType is a type of value associated with current node, distinct from the key.
Comments bubble
keyType should be easily comparable.
valueType is a type of value associated with current node, distinct from the key.

Note that in Go you can methods of pointer type *BinTree even on a nil receiver (an empty tree).
Demo URL
http://play.golang.org/p/MK3qoaVPol
Demo URL
http://play.golang.org/p/MK3qoaVPol