1) I need to construct a function that removes duplicates in a binary search tree. Each node in the binary search tree has a char (string) value. Duplicates need to be removed and only one node (the first one to appear) with that string value can stay in the tree. The function takes in the pointer to the root of the binary search tree we want to modify. Finally, we need to return the pointer to the root of the new/modified binary search tree (same type as the parameter).
2) I need to construct a function that takes in a linked list as a parameter and creates a balanced binary search tree. Each node of the linked list has an int value.
Then we need to return the pointer to the root of the new balance binary search tree.
Get Free Quote!
424 Experts Online