symbol table abstraction

Symboltable.go

type SymbolTable struct {
	data *BSTree
}

//adds or updates node with key "key"
func (st *SymbolTable) put(key string, val int) {
	st.data.root = put(st.data.root, key, val)
}

//returns node with key "key"
func (st *SymbolTable) get(key string) *Node {
	return get(st.data.root, key)
}
// checks if node with key "key" exists in symbol table
func (st *SymbolTable) contains(key string) bool {
	return get(st.data.root, key) == nil
}

//returns an array of Nodes in sorted order
func (st *SymbolTable) keys() []Node {
	return returnKeys(st.data.root)
}