Prateek
BAN USER
Comments (13)
Reputation 10
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
We can use a normal BST with count of nodes in the left and right subtree at each node, and update each count in every subsequent update.. Searching for the nth rank node will be a binary search... Its similar to the rank finding algorithm... insertion and retrieval both O(log n)
- Prateek September 30, 2010Comment hidden because of low score. Click to expand.
0
of 0 vote
We can use a normal BST with count of nodes in the left and right subtree at each node, and update each count in every subsequent update.. Searching for the nth rank node will be a binary search... Its similar to the rank finding algorithm... insertion and retrieval both O(log n)
- Prateek September 30, 2010Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
Hi RAM,
- Prateek October 03, 2010Can you give some hint?