void bst::insert(int d) { node*newnode = new node(); newnode_>data = d; if(root==noull) { root=newnode; } else { node*tempnode = new node(); node*backtempnode = newnode(); tempnode = root; while(tempnode !=NULL) { backtempnode = tempnode; if(tempnode_>data<=newnode_>data) { tempnode = tempnode _>rightchild; } else { tempnode = tempnode _>leftchild; } } newnode_>parent =backtempnode; if(backtempnode _>data<=newnode_>data) { backtempnode_>rightchild=newnode; } else { backtempnode_>leftchild = newnode } } }
var
This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)