One singular exception is the case of exercise #0116-populating-next-right-pointers-in-each-node which, as of the time i'm writing this PR, is not implemented by Leetcode. I've changed the TreeNode struct definition to accomodate the next pointer in the way i imagine they'll implement it in the future. In the end, the solution compiles and has a (kind of) test case in it.
This PR closes issue #16 with tested solutions.
One singular exception is the case of exercise
#0116-populating-next-right-pointers-in-each-nodewhich, as of the time i'm writing this PR, is not implemented by Leetcode. I've changed theTreeNodestruct definition to accomodate thenextpointer in the way i imagine they'll implement it in the future. In the end, the solution compiles and has a (kind of) test case in it.