problem 1: Insert 2 3 6 1 7 78 54 23 0 55 one by one into an initially empty Binary Search tree.

problem 2: Compare some search trees.

problem 3: prepare non-recursive algorithms for tree traversals methods.

problem 4: Insert 2 9 4 1 7 10 3 6 5 8 one by one into an initially empty AVL tree. Show the AVL tree after each insertion.

problem 5: prepare algorithm for insertion in to B-tree. Describe it with exs.

problem 6: Describe about m-way search trees.

problem 7: Describe how to delete element from B-tree with illustration.

problem 8: Insert 1 5 2 3 7 8 70 34 51 21 63 28 92 into 3- way search tree.

problem 9: prepare algorithm to implement Brute-Force technique in pattern matching.

problem 10: Compare the string “data” in text “this is data structures in c++ class” by using KMP algorithm.