Forum: ASP.NET Nov 30th, 2008 |
| Replies: 5 Views: 420 Thanks for your reply.
Asp .net was released in January 2002 with version 1.0
So you are saying
Before 2002 we had mission critical code written in Cobal, fortran etc. and now to use that... |
Forum: ASP.NET Nov 30th, 2008 |
| Replies: 5 Views: 420 The syntax of C# is very different from VB .Net or J#.
The logic may be same |
Forum: ASP.NET Nov 30th, 2008 |
| Replies: 5 Views: 420 I have a basic question in .Net
Why there is a need for .Net Framework supporting different languages? Is it not better to train everyone in a single language?
Thanks. |
Forum: C# Nov 18th, 2008 |
| Replies: 11 Views: 1,172 We have a binary tree
50
30 70
10 40 60 80
The following code doesn't work for... |
Forum: C# Nov 18th, 2008 |
| Replies: 11 Views: 1,172 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 |
Forum: C# Nov 18th, 2008 |
| Replies: 11 Views: 1,172 How will you write
if self.rightChild:
succ = self.rightChild.findMin()
in C# |
Forum: C# Nov 18th, 2008 |
| Replies: 11 Views: 1,172 How can I start to convert the code in C# and test it? |
Forum: C# Nov 18th, 2008 |
| Replies: 11 Views: 1,172 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: |
Forum: C# Nov 18th, 2008 |
| Replies: 11 Views: 1,172 What will be the C# version of the below code.
int findSuccessor(self):
succ = None
if self.rightChild:
succ = self.rightChild.findMin()
else:
if... |
Forum: C# Nov 18th, 2008 |
| Replies: 11 Views: 1,172 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. |