diff --git a/tree/tried/tried.go b/tree/tried/tried.go
new file mode 100644
index 0000000..b4678f2
--- /dev/null
+++ b/tree/tried/tried.go
@@ -0,0 +1,96 @@
+package tried
+
+type Tried struct {
+	root     *Node
+	datasize uint
+	// wordIndex func ()
+}
+
+type Node struct {
+	data  []*Node
+	value interface{}
+}
+
+func New() *Tried {
+	tried := &Tried{}
+	tried.root = new(Node)
+	return tried
+}
+
+func (tried *Tried) Put(words string, values ...interface{}) {
+	cur := tried.root
+	var n *Node
+	for i := 0; i < len(words); i++ {
+		w := uint(words[i] - 'a')
+
+		if cur.data == nil {
+			cur.data = make([]*Node, 26)
+		}
+
+		if n = cur.data[w]; n == nil {
+			n = new(Node)
+			cur.data[w] = n
+		}
+		cur = n
+	}
+
+	vlen := len(values)
+	switch vlen {
+	case 0:
+		cur.value = tried
+	case 1:
+		cur.value = values[0]
+	case 2:
+		// TODO: 执行函数 values[1] 为函数类型 func (cur *Node, value interface{}) ...可以插入, 也可以不插入
+	default:
+		panic("unknow select to do")
+	}
+
+}
+
+func (tried *Tried) Get(words string) interface{} {
+	cur := tried.root
+	var n *Node
+	for i := 0; i < len(words); i++ {
+		w := uint(words[i] - 'a') //TODO: 升级Index 函数
+		if n = cur.data[w]; n == nil {
+			return nil
+		}
+		cur = n
+	}
+	return n.value
+}
+
+func (tried *Tried) Has(words string) bool {
+	return tried.Get(words) != nil
+}
+
+func (tried *Tried) Traversal(every func(cidx uint, value interface{}) bool) {
+
+	var traversal func(*Node)
+	traversal = func(cur *Node) {
+		if cur != nil {
+			for i, n := range cur.data {
+				if n != nil {
+					if n.value != nil {
+						if !every(uint(i), n.value) {
+							return
+						}
+					}
+					traversal(n)
+				}
+			}
+		}
+	}
+
+	root := tried.root
+	traversal(root)
+}
+
+// func (tried *Tried) String() []string {
+// 	var result []string
+// 	tried.Traversal(func(cidx uint, value interface{}) bool {
+// 		result = append(result, spew.)
+// 	})
+// 	return result
+// }
diff --git a/tree/tried/tried_test.go b/tree/tried/tried_test.go
new file mode 100644
index 0000000..fbc6d1d
--- /dev/null
+++ b/tree/tried/tried_test.go
@@ -0,0 +1,71 @@
+package tried
+
+import (
+	"testing"
+)
+
+func TestTried_PutAndGet1(t *testing.T) {
+	tried := New()
+	tried.Put("asdf")
+	tried.Put("hehe", "hehe")
+	tried.Put("xixi", 3)
+
+	var result interface{}
+
+	result = tried.Get("asdf")
+	if result != tried {
+		t.Error("result should be 3")
+	}
+
+	result = tried.Get("xixi")
+	if result != 3 {
+		t.Error("result should be 3")
+	}
+
+	result = tried.Get("hehe")
+	if result != "hehe" {
+		t.Error("result should be hehe")
+	}
+
+	result = tried.Get("haha")
+	if result != nil {
+		t.Error("result should be nil")
+	}
+
+	result = tried.Get("b")
+	if result != nil {
+		t.Error("result should be nil")
+	}
+}
+
+func TestTried_Traversal(t *testing.T) {
+	tried := New()
+	tried.Put("asdf")
+	tried.Put("abdf", "ab")
+	tried.Put("hehe", "hehe")
+	tried.Put("xixi", 3)
+
+	var result []interface{}
+	tried.Traversal(func(idx uint, v interface{}) bool {
+		// t.Error(idx, v)
+		result = append(result, v)
+		return true
+	})
+
+	if result[0] != "ab" {
+		t.Error(result[0])
+	}
+
+	if result[1] != tried {
+		t.Error(result[1])
+	}
+
+	if result[2] != "hehe" {
+		t.Error(result[2])
+	}
+
+	if result[3] != 3 {
+		t.Error(result[3])
+	}
+
+}