may you please provide dry run for his code as it is very confusing and I am messed up with it for a long, as I don’t understand why dont he initilised a constructor and kept default value of both the pointers 0 at the same time why isn’t there any field in try node to keep the data , as it would have been easier to apply,
please give it’s algorithm and give me a dry run of some inputs as I am unable to understand anything here
MAX xor pair need more clear and detailed explanation
We do not create any data field, as there are only 2 values possible and for each value we are using a pointer, also for every object only one of the two (left/right) will not have value NULL, other will be NULL, so a simply checking which pointer is not NULL will also tell us the value of current node. As we have only two pointer and no data field so we do not create the constructor, also even if we create the constructor we will still have to use a insert function to check if next node is present or not.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.