Wednesday, November 21, 2012

BST, kth

 Find the Kth largest integer in a Binary Search Tree. 
Pubblicato da a
Reazioni: 

1 comment:

  1. In order Depth First Search (in reverse order, going toward the maximum branch first will give the elements in order from the biggest to the smallest) and at the same time count until K, then print.

    ReplyDelete

Subscribe to: Post Comments (Atom)