Thread: Binary Search Tree for student records

You simply need to decide how the data should be sorted. For example, by name, class or id. You can also take into account multiple members, for example prioritize class but also consider name and id, generating a sorting of this likeness:

Code:

Not sorted:
1234 Albert 1b
1236 Nick 1c
1235 John 2a
1354 Bob 1b
1198 Alfred 1c
1024 Jim 2a

Sorted:
1234 Albert 1b
1354 Bob 1b
1198 Alfred 1c
1236 Nick 1c
1024 Jim 2a
1235 John 2a