Cracking The Code.Did You Know Efficient & Working Code Really Matters: Given a root and a node of a BST tree, write a function which print all the nodes which are a 'k' distance from the given nodes in sorted order. (distance can be upwards and downwards)

Friday, February 3, 2012

Given a root and a node of a BST tree, write a function which print all the nodes which are a 'k' distance from the given nodes in sorted order. (distance can be upwards and downwards)

No comments :

Subscribe to: Post Comments ( Atom )