HW6 Binary Search Tree

Deadline : 2024/05/15 (Wed.)   "Read before submission" 

Request : 

1. Insert an integer data in a binary search tree (BST). After the insertion, use a "recursive approach" to traverse the tree  by the "inorder traversal" and print the traversed sequence, which should be  in the nondecreasing order.

2. k integer data, which are generated randomly within a specified range assigned by the user, can be inserted into the BST. After these k integers are inserted, traverse the tree by "inorder sequence" and print the sequence.

3. Delete an integer number from BST (assigned by user).

4. Search an target integer in the BST.

4. Traverse the BST recursively to obtain the 

4.1 inorder sequence (or infix);

4.2 preorder sequence (or prefix);

4.3 postorder sequence (or postfix);

5. Traverse the BST to obtain the levelorder sequence.

Bonus : 

1. Traverse the BST non-recursively to obtain the 

1.1 inorder sequence;

1.2 preorder sequence;

1.3 postorder seqeunce.

2. Non-recursively insertion 

3. Others ...

Program Example