Function TestTreeLevelOrder

structure/tree/tree_test.go:199–256

(t *testing.T)

}

func TestTreeLevelOrder(t *testing.T) {
	t.Run("Test for Binary-Search Tree", func(t *testing.T) {
		tests := []struct {
			input []int
			want  []int
		}{
			{[]int{90, 80, 100, 70, 85, 95, 105}, []int{90, 80, 100, 70, 85, 95, 105}},
			{[]int{90, 80, 100, 70, 85, 95, 105, 1, 21, 31, 41, 51, 61, 71},
				[]int{90, 80, 100, 70, 85, 95, 105, 1, 71, 21, 31, 41, 51, 61}},
			{[]int{10, 9, 8, 7, 6, 5, 4, 3, 2, 1}, []int{10, 9, 8, 7, 6, 5, 4, 3, 2, 1}},
		}
		for i, tt := range tests {
			tree := bt.NewBinarySearch[int]()
			tree.Push(tt.input...)
			if ret := tree.LevelOrder(); !reflect.DeepEqual(ret, tt.want) {
				t.Errorf("#%d Error with LevelOrder", i)
			}
		}
	})

	t.Run("Test for AVL Tree", func(t *testing.T) {
		tests := []struct {
			input []int
			want  []int
		}{
			{[]int{90, 80, 100, 70, 85, 95, 105}, []int{90, 80, 100, 70, 85, 95, 105}},
			{[]int{90, 80, 100, 70, 85, 95, 105, 1, 21, 31, 41, 51, 61, 71},
				[]int{70, 41, 90, 21, 51, 80, 100, 1, 31, 61, 71, 85, 95, 105}},
			{[]int{10, 9, 8, 7, 6, 5, 4, 3, 2, 1}, []int{7, 3, 9, 2, 5, 8, 10, 1, 4, 6}},
		}
		for i, tt := range tests {
			tree := bt.NewAVL[int]()
			tree.Push(tt.input...)
			if ret := tree.LevelOrder(); !reflect.DeepEqual(ret, tt.want) {
				t.Errorf("#%d Error with LevelOrder", i)
			}
		}
	})

	t.Run("Test for Red-Black Tree", func(t *testing.T) {
		tests := []struct {
			input []int
			want  []int
		}{
			{[]int{90, 80, 100, 70, 85, 95, 105}, []int{90, 80, 100, 70, 85, 95, 105}},
			{[]int{90, 80, 100, 70, 85, 95, 105, 1, 21, 31, 41, 51, 61, 71},
				[]int{80, 41, 90, 21, 61, 85, 100, 1, 31, 51, 70, 95, 105, 71}},
			{[]int{10, 9, 8, 7, 6, 5, 4, 3, 2, 1}, []int{7, 5, 9, 3, 6, 8, 10, 2, 4, 1}},
		}
		for i, tt := range tests {
			tree := bt.NewRB[int]()
			tree.Push(tt.input...)
			if ret := tree.LevelOrder(); !reflect.DeepEqual(ret, tt.want) {
				t.Errorf("#%d Error with LevelOrder %v", i, ret)
			}
		}
	})
}