Answer Posted / raj

Simple way:

public int FindDepthOfTree(RBNode n)
{
if (n == null) return 0;
return Math.Max(FindDepthOfTree(n.LeftNode),
FindDepthOfTree(n.RightNode)) + 1;
}

Sir... please give some important coding questions asked by product companies..

1793

---

#include int main(void) { int a=4, b=2; a=b<>2 ; printf("%d",a); return 0; }

1067

---

How can you relate the function with the structure? Explain with an appropriate example.

2915

---

Given a spherical surface, write bump-mapping procedure to generate the bumpy surface of an orange

2859

---

why nlogn is the lower limit of any sort algorithm?

2373

---

---

could you please send the program code for multiplying sparse matrix in c????

3067

---

How to palindrom string in c language?

8840

---

To Write a C program to remove the repeated characters in the entered expression or in entered characters(i.e) removing duplicates. String contains only lowercase characters ['a'-'z']

493

---

write a function to give demostrate the functionality of 3d in 1d. function prototye: change(int value,int indexX,int indexY,int indexZ, int [] 1dArray); value=what is the date; indexX=x-asix indexY=y-axis indexZ=z-axis and 1dArray=in which and where the value is stored??

4140

---

Can you send Code for Run Length Encoding Of BMP Image in C Language in linux(i.e Compression and Decompression) ?

3845

---

Set up procedure for generating a wire frame display of a polyhedron with the hidden edges of the object drawn with dashed lines

3026

---

how to create a 3x3 two dimensional array that will give you the sums on the left and bottom columns

3117

---

What is the match merge ? compare data step match merge with proc sql merge - how many types are there ? data step vs proc sql

2405

---

What is full form of PEPSI

1865

---

3) Int Matrix of certain size was given, We had few valu= es in it like this. =97=97=97=97=97=97=97=97=97=97=97 1 = | 4 | | 5 | &= nbsp; | 45 =97=97=97=97=97=97=97=97=97=97=97 &n= bsp; | 3 | 3 | 5 | = | 4 =97=97=97=97=97=97=97=97=97=97=97 34 |&nbs= p; 3 | 3 | | 12 | &= nbsp; =97=97=97=97=97=97=97=97=97=97=97 3 | &nbs= p; | 3 | 4 | = | 3 =97=97=97=97=97=97=97=97=97=97=97 3 | = ; | | | = ; 3 | =97=97=97=97=97=97=97=97=97=97=97 &= nbsp; | | 4 | = ; | 4 | 3 We w= ere supposed to move back all the spaces in it at the end. Note: = If implemented this prog using recursion, would get higher preference.

3317

---