Traversal algorithms issue #16

data-structures/binary-tree/bst.go

@@ -157,3 +157,43 @@ func IterOnTree(n *Node, f func(*Node)) bool {
 
 	return IterOnTree(n.Right, f)
 }
+
+func (t *Tree) PreOrder(n *Node) []int {
+	var nodes []int
+
+	if n == nil {
+		return nodes
+	}
+
+	nodes = append(nodes, n.Value)
+	nodes = append(nodes, t.PreOrder(n.Left)...)
+	nodes = append(nodes, t.PreOrder(n.Right)...)
+	return nodes
+}
+
+func (t *Tree) InOrder(n *Node) []int {
+	var nodes []int
+
+	if n == nil {
+		return nodes
+	}
+
+	nodes = append(nodes, t.PostOrder(n.Left)...)
+	nodes = append(nodes, n.Value)
+	nodes = append(nodes, t.PostOrder(n.Right)...)
+	return nodes
+}
+
+func (t *Tree) PostOrder(n *Node) []int {
+	var nodes []int
+
+	if n == nil {
+		return nodes
+	}
+
+	nodes = append(nodes, t.PostOrder(n.Left)...)
+	nodes = append(nodes, t.PostOrder(n.Right)...)
+
+	nodes = append(nodes, n.Value)
+	return nodes
+}

data-structures/binary-tree/bst_test.go

@@ -2,6 +2,7 @@ package bst
 
 import (
 	"fmt"
+	"reflect"
 	"testing"
 )
 
@@ -52,3 +53,72 @@ func TestTree(t *testing.T) {
 		t.Error()
 	}
 }
+
+func TestTraversalAlgorithms_PreOrder(t *testing.T) {
+	n := NewNode(1)
+
+	tree := NewTree(n)
+
+	tree.Insert(4)
+	tree.Insert(2)
+	tree.Insert(5)
+	tree.Insert(3)
+	tree.Insert(6)
+
+	actual := tree.PreOrder(n)
+	expected := [...]int{1, 4, 2, 3, 5, 6}
+
+	for i, num := range actual {
+		if num != expected[i] {
+			if !reflect.DeepEqual(expected, actual) {
+				t.Errorf("PreOrder() = %v, want %v", actual, expected)
+			}
+		}
+	}
+}
+
+func TestTraversalAlgorithms_InOrder(t *testing.T) {
+	n := NewNode(1)
+
+	tree := NewTree(n)
+
+	tree.Insert(4)
+	tree.Insert(2)
+	tree.Insert(5)
+	tree.Insert(3)
+	tree.Insert(6)
+
+	actual := tree.InOrder(n)
+	expected := [...]int{1, 3, 2, 6, 5, 4}
+
+	for i, num := range actual {
+		if num != expected[i] {
+			if !reflect.DeepEqual(expected, actual) {
+				t.Errorf("InOrder() = %v, want %v", actual, expected)
+			}
+		}
+	}
+}
+
+func TestTraversalAlgorithms_PostOrder(t *testing.T) {
+	n := NewNode(1)
+
+	tree := NewTree(n)
+
+	tree.Insert(4)
+	tree.Insert(2)
+	tree.Insert(5)
+	tree.Insert(3)
+	tree.Insert(6)
+
+	actual := tree.PostOrder(n)
+	expected := [...]int{3, 2, 6, 5, 4, 1}
+
+	for i, num := range actual {
+		if num != expected[i] {
+			if !reflect.DeepEqual(expected, actual) {
+				t.Errorf("PostOrder() = %v, want %v", actual, expected)
+			}
+		}
+	}
+}