is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
When you are inserting elements in your tree, you have to update how many elements are in the left and right subtree for all elements you traverse through while you insert the new values.
- InternetHero July 12, 2015i.e
struct Node
{
Node* left, *right;
int value, leftSize, rightSize;
}
Then using those values you can work out how many elements are larger than your current value:
start with sum = root->rightSize
curNode = root;
if turning left:
sum += curNode->rightSize + 1
curNode = curNode->left;
if turning right:
sum -= (curNode->leftSize + 1)
curNode = curNode->right;
when you hit the element in question sum will be the number of elements larger than it in th BST