Search:

ok so i have a binary tree(not a search one)

i declared it using an array like this


a[7]=0 1 2 3 4 5 6//lets say

1 2 3 4 5 6 7

node 0 is the root and has the key 1

ok i'm a litlle nervous here because for 2 days i'm doing this stupid problem


when i enter the middlenode function, x is set before the node with a info...this is for C_ntua to be no doubt...
...

hy, where i can get some good tutorials about trees

Binary trees , Hufman trees and heap procedure...

thanks...

//best regards

ok..so i'm back

this the code so far


#include <iostream>

using namespace std;

struct node

thanks mats, your information is great but i have a question
lets assume the next linked list
1 2 3 3 3 5 6

if i want to delete 3 i would delete first 3 and i'l be linked with next one

thank you very much for reply's , i didn't expect that much reply's


ok so i have here a linked list with n nodes
i've wrote it in english



#include <iostream>

hello
the problem is like this i have a linked list, i need to delete the nods that have info 'a'

the program is this one




#include <iostream>