[algogeeks] Finding closest double in a Btree

[Supraja Jayakumar]

Hi

Question is given a binary tree and a key K, code to find the node with the
closest value.

I'd be happy to receive some feedback about my solution too.

Pls find the code below:

class FindingClosestNodeInTree {
private static double difference = 0.0;
private static doule key = 0.0;
int main() {
    BinaryTree bt;
    bt.insert(20.43);
    bt.insert(12.78);
    bt.insert(19.89);
    bt.insert(32.69);
    bt.insert(2.54);
    cout << "Please provide the key value" << endl;
    cin >> key;
    const Node &closestNode = closestValue(bt);
    cout << << "Node that has the closest value to " <<  <<
closestNode.value;
return 1;
}
const Node & closestValue(const BinaryTree &node) {
if(node==null)
    return;

int val = node.value;
int currDiff = val > key ? val-key:key-val;
difference = currDiff > difference ? currDiff:difference;
if(node.left!=null)
    closestValue(node.left);
if(node.right!=null)
    closestValue(node.right);
return difference;
}
}

Thanks
Supraja J

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.