Reflecting on a tweet by Max Howell:

Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fvck off.

So in your language of choice how do you invert a Binary Tree.

For example:
This
1
/ \
2 3
/ \ \
4 5 6

To this
4 5 6
\ / /
2 3
\ /
1

project7:
Reflecting on a tweet by Max Howell:

Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fvck off.

So in you language of choice how do you invert a Binary Tree.

For example:
This
1
/ \
2 3
/ \ \
4 5 6

To this
4 5 6
\ / /
2 3
\ /
1

I don't even understand.

project7:
Reflecting on a tweet by Max Howell:

Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fvck off.

So in you language of choice how do you invert a Binary Tree.

For example:
This
1
/ \
2 3
/ \ \
4 5 6

To this
4 5 6
\ / /
2 3
\ /
1

[size=19pt]Javascript [/size]


var tree = function(root) {
if (!root)
return null;
tree(root.left);
tree(root.right);
x = root.left;
root.left = root.right;
root.right = x;

return root;
};

Simple and easy

crap. Does he invert binary trees in his "day job"?
Did he invert binary tree when creating home brew?
These interviewers just pull questions out of their ass and fling them at interviewees.

asalimpo:
crap. Does he invert binary trees in his "day job"?
Did he invert binary tree when creating home brew?
These interviewers just pull questions out of their ass and fling them at interviewees.

You get the whole point of that wrong. Yes the interview process is flawed. But a company like google is always about scaling and efficiency. Knowing when to use an array or a binary search tree really has a lot of payoff for a company like google. 70% of google engineers maintain and refactor code bases but their is 30% that takes on a new project aimed at millions of users. Knowing the right data structures to use helps a lot. And that dude was not rejected because he coundt invert a binary tree. Failing one question doesn't spell doom for a google interview

SeunLanLege:


[size=19pt]Javascript [/size]


var tree = function(root) {
if (!root)
return null;
tree(root.left);
tree(root.right);
x = root.left;
root.left = root.right;
root.right = x;

return root;
};

Simple and easy

When you copy a code online ,understand it. This does not invert a binary tree.

sharrp:

When you copy a code online ,understand it. This does not invert a binary tree.

Really? Then enlighten us, oh great one.

Oh and point links to where I copied the code. . When making accusations provide proof or you'll make yourself look immature.

google did that to mock the guy

they even said Bleep u nvidia

SeunLanLege:


Really? Then enlighten us, oh great one.

Oh and point links to where I copied the code. . When making accusations provide proof or you'll make yourself look immature.

I know you... i saw you at that microsoft aiki program at funaab today