下个月准备换evo 3d。但是# PDA - 掌中宝
s*n
1 楼
Find the K'th Maximum Element in a Binary Search Tree . Do it in O(log N).
Please dont do a in order tree traversal and return the K'th element from
the end. I told that but interviewer did not wanted me to traverse the
entire tree. Any suggestions ?
Please dont do a in order tree traversal and return the K'th element from
the end. I told that but interviewer did not wanted me to traverse the
entire tree. Any suggestions ?