Search:

hello

when write an algorithm then there is title like
Procedure name(parameter)
My question is that sometimes instead of procedure there is function and sometimes it is procedure... so when i...

i know that process but when first partition is done means elements which is less than pivot is in left side and elements which is greater than pivot is in right side of pivot.
but what is the...

hello
can anyone explain quick sort example using last element as pivot element. I know how to sort element using first and middle element as pivot element.

k thanks for ans

hello
I know to create binary tree from given any two traversal i.e. Inorder/preorder or inorder/postorder. But can anuone explain how to create binary tree from given Inorder?
For example...

can you explain example given in attach file?

thanks for ans sir
I have read that and understand what article say but i refer the book "An introduction to data structures with applications" author= "jean paul and palu G" . In book there is...

can anyone tell me what happen in weight balanced tree with simple example? how to determine weight of each node?

i have read that article but it shows that transfer node from left to right and right to left...i understand that but it don't show which node become root node when any rotation is occur and why...

hello

i have question about AVL tree re balancing. In AVL tree when AVL is unbalanced then how can i decide which node become root node ? I have search in Google but i can't get specific rule or...

i am giving sort example like if i have numbers to be sort like
42 23 74 11 65 58 94 36 99 87
First i will sort first two elements, then 3 and 4 then 5 and 6 then 7 and 8 and at last 9 and 10...

you are write i have declare target=NULL and also when node have only one child left or right at that time while loop condition become false... but i don't have any idea..can you suggest algorithm...

Hello

I am tracing the algorithm for two way merge sort....This algorithm start with loop like
Repeat for L=1,2,4,....2^[log2N]-1
If log2 L is even
then
call mergesort

I...

yes i have use debugger...i have put if condition after completing while loop...


if(target == NULL)
{
if(root->left->data ==num)
target=root->left;

else if(root->right->data==num)...

thanks for ans
my program not work in only some case...For example
Input data is 50,25,20,40,75,60,80 BST is created with inputted data
Now first time i delete node 75 then it display ans 50...

anyone help me? plzz

Hello
I have write program in c++ which delete node from BST. It work for some level.Mean it wrok well when some nodes are delte but when i delete root node program print garbage value infinite...

i think you saying that whenever any user send inquiry from web then it will like as shown in image....
so you say that "same source and have similar subject" it means at each time user send...

actually i don't know what is right answer. i find this example from the net.

hello

Here i trying to find the complexity of given code...


For(int i=0;i<n;i++) O(n)
For(int j=0;j<n;j++) O(n) ...

actually hosting done by someone else

sir i have write "telnet" in Run but it's can't find.....error occur "Windows can not find telnet. Make sure you typed name correctly and then try again".

i think you are write email do not overwrite but how can i explain my question!!!!....it's difficult
for that My code is



protected void btnadd_Click(object sender, EventArgs e)
{
...

hello all

i have developed website and in it there is one module that send inquiry to the admin. My problem is that email is send properly but when second mail send it will be overwrite for...

can you tell me how to start telnet? n do all the things that you have said... and firewall would be off only for gmail? if i change yahoo then it will be done?