Thread: Question on algorithm

I need to write a program that uses a binary search tree, and linear linked list, but I can only use 1 struct, are there any tutorials about how to do either one without using a structure?

Originally Posted by Brimak86

I need to write a program that uses a binary search tree, and linear linked list, but I can only use 1 struct, are there any tutorials about how to do either one without using a structure?

You can use the same struct for both. The tree has a "left" and a "right." The list has a "next." So just use "right" to mean "next" for the list, and pretend that "left" doesn't exist.