We have a binary tree

50
30 70

10 40 60 80


The following code doesn't work for...

I have a binary tree

50

30 70

10 40 60 80

The below code is not giving the correct result for test cases 80, 83, 60, 11

How will you write


if self.rightChild:
succ = self.rightChild.findMin()


in C#

How can I start to convert the code in C# and test it?

I have not done this in C#.



int findSuccessor(self):
succ = None
if self.rightChild:
succ = self.rightChild.findMin()
else:
if self.parent.leftChild == self:

What will be the C# version of the below code.

int findSuccessor(self):
succ = None
if self.rightChild:
succ = self.rightChild.findMin()
else:
if...

How can we find the next highest value in the binary tree?

We have a binary tree and an number is being input. We need to find the next highest number.