Search:

hello guys

how can i add the ability to delete and search in this AVL code ?




#include<iostream>
#include<cstdio>
#include<sstream>

thanks for the reply

then how should i write a code to solve this ?
i know i have to write a recursive code that's for sure but i really don't know what should i write ?

i also found a algorithm for the problem :
See: 'Tower of Hanoi with adjacency requirement (Ex. 8.1.18)' in
http://appsrv.cse.cuhk.edu.hk/~chi/csc2110-2009/notes/T10.pdf

but still cant put it...

i don't think its that simple !
for example for 2 disk , it would take 3 moves in normal hanoi , but in this case it would take 8 moves ! i dont think adding that would solve it


btw i updated...

so we have to change this recursive hanoit tower code and add this condition to it :
we cant move any disk from peg 0 to peg 2 directly
also we can't move any disk from peg 2 to peg 0 directly ,...

i tried this : but it has a bug
after i add a new student it stores grades with value of 0

i tried everthing but it gives me error everytime , maybe i should rewrite the code ?
how about you help me with the first code and tell me how to add GPA calculator for students that would be nice

this code stores information about students (with linked list) , i need to add these abilities to it :

1.add and remove course and get the grade of the course
2.calculating the GPA of students...

this program gets and stores information about students , you can add , remove and also add and remove course for every student , also prints the information


but how can i add the ability to...