dragonbone

HI , I am a student in an university... I am assigned a project about the knight's tour on the chess , but must use the Warnsdorff's rule ... rule : Put a knight on the chess with any square , and find all patchs of knight (knight pass each …

I try write about binary tree , but i have some troubles , I insert some symbols into binary tree by 2 function insertLeft () and insertRight () ...When i display the symbols i see to lack some symbols .. who can help me ???thank very much [CODE]#include<stdio.h> #include<conio.h> #include<string.h> …

[CODE]#include<stdio.h> #include<conio.h> void main(){ long n; char ch; clrscr(); do{ clrscr(); printf("\nEnter a number : "); scanf("%ld",&n); long p,sum =0 ; int temp=0; p=n; while(1){ temp= p%10; sum = sum*10+temp; p= p/10; if(p==0) break; } printf("\nAfter rererse number %ld is %ld \n",n, sum); printf("\nDo you want to continue ?(Y/N) "); …