ex6 exam question about building a binary tree from a set of strings - bug in my code

Question

Hi all. I have written a code for the ex6, I know there is a bug and I know why and where, but I haven't been able to fix it using the same logic (like without using a for loop over each element of string). So if anyone is interested in finding a way and has found it then please share.

Answer 1

Hey.

First of all, it is prohibited to share an original code(you can loose points). Anyway I executed your program, and as u mentioned before your code returns IndexError. Each node can have 0,1,2 children nodes, at this point u should slice strings inside of "new" in another way.  Also remember your tree must be sorted according to algorithm described in exercise

Good luck