Example #1
0
    void
    Tree::crudeBalance()
    {
      if (d_root.get() == NULL) {
	return;
      } // if
      std::vector<Node> nodes;
      appendNode(nodes, *d_root);

      
      std::sort(nodes.begin(), nodes.end());
      for (size_t i = 0; i < nodes.size(); ++i) {
	deleteVal(nodes[i].value());
      } // for

      balanceBySortedArray(nodes, 0, nodes.size() - 1);
    }         
Example #2
0
void removeDuplicates(struct node * ptr){
	while(ptr->next != NULL){
		deleteVal(ptr->next,ptr->val);
		ptr = ptr->next;
	}
}