Bloomberg LP Interview Question
Financial Software Developersstruch Node {
int data;
Node *leftChild;
Node *rightChild;
};
// Depth First Traversal
dfsTraversal(Node *ptr)
{
if(ptr == NULL)
{
return;
}
cout << ptr->data << " -> " ;
// Traverse Left Child
Node *lChild = ptr->leftChild;
if(lChild != NULL)
{
dfsTraversal(lChild);
}
// Traverse Right Child
Node *rChild = ptr->rightChild;
if(rChild != NULL)
{
dfsTraversal(rChild);
}
}
- Zhengyang.Feng2011 March 13, 2012