Skip to main content
Code Review

Return to Answer

added 1 character in body
Source Link
convert
convert
  • 1
  • 1
  • 2
  • 9

This solution looks really complicated, since normalinormaly it should be left<rightleft<=right. In this case you first have to find the left node and then the right one. The simplest solution is just using for loops to get to the coresponding nodes. Also error handling seems to be mising for example when right<left or one or both values are out of bounds.

This solution looks really complicated, since normali it should be left<right. In this case you first have to find the left node and then the right one. The simplest solution is just using for loops to get to the coresponding nodes. Also error handling seems to be mising for example when right<left or one or both values are out of bounds.

This solution looks really complicated, since normaly it should be left<=right. In this case you first have to find the left node and then the right one. The simplest solution is just using for loops to get to the coresponding nodes. Also error handling seems to be mising for example when right<left or one or both values are out of bounds.

Source Link
convert
convert
  • 1
  • 1
  • 2
  • 9

This solution looks really complicated, since normali it should be left<right. In this case you first have to find the left node and then the right one. The simplest solution is just using for loops to get to the coresponding nodes. Also error handling seems to be mising for example when right<left or one or both values are out of bounds.