yeah binary tree ;)

Wife: what are you thinking about?

Me: how to optimize key storage in a binary tree

Wife: forget that I asked

Yo mama's so fat that if she sat on a binary tree she will convert it into a linked list in O(1) time

Yo mama so fat that when she sat on binary tree it became a linked list

Yo momma so fat, she sat on my binary tree and it collapsed into a linked list!

- Anon from Reddit.

Please help

Hell yeah

Open source block chain neural network binary tree growth hacker synergy vertically integrating cryptocurrency game changing GDPR compliant internet of things node.js quantum computing start up that'll disrupt and pivot the cloud based ecosystem

I needed to sort the caps for my spices. Decided to use a binary search tree.

You are asked by airport security to balance this binary tree to prove you're a programmer. How fucked are you?

"binary tree" is the buzzword of data structures.

Computer Scientists put the root at the top of their trees because they've never been outside to see what a real tree looks like

Hmmm, this feature that I added seems to make the whole process 50% longer. I need to optimize something. Let's see now...
Yeah, make that a shared resource and parallelize IO to leverage the multi-core architecture. Hash map for this, binary tree for that. This thing that gets called a million times can be written easily without a regexp. That thing can be rewritten in Rust as it's too demanding.

There! Works! And it's also a lot cleaner. Nice!

How's the performance doing? 70% longer.

So during a test I was to write an algo of binary search tree traversal and I got a zero....Why? Cause I wrote a recursive algorithm and also because I wrote "English" instead of pseudocode, which she thought is called algorithm and on showing her the exact same recursive Algo on various websites and books, she just declared all of them wrong

Android dev job question:

"Describe the activity lifecycle and write an application that does x,y,z in accordance with it"

Fullstack dev job question:

"Write some code that interacts with our API and does x,y,z, put the data into our database and build a web interface"

Java backend dev interview :
"BUILD AN ELEVATOR ALGORITHM WITH LESS THAN o(nlog(n)), FIND NEIGHBORS IN A BINARY TREE, WHAT IS THE DIFFERENCE BETWEEN AN INTERFACE AND ABSTRACT CLASS?"

Why?

Binary Tree

Boy oh boy.. Reminds me of good ol college days. I was in my final sem when Amazon came to our university for campus hiring. I was very confident that I will get selected. Funnily enough I went till the final round and I had a feeling that it went well if not excellent. It was a Friday night and we had to wait two excruciating days for the final shortlisted result to come. On the evening of Monday my friend T called me and told me my name is not on the list. I was heartbroken. I asked him who all got selected and he said our friend A did. A was, and still is a good friend of ours and I was happy for him. That night we sat down for drinks and as the night progressed I anguished over my selection. I still remember solving a binary tree problem holding a glass of whiskey in my one hand. The next morning I woke up at 6, detoxed myself with fruit juices and sat in front of my laptop feeling full rage from last night. I sat till lunch and hacked a chrome extension in one sitting. Mind you I had no existing knowledge of extensions at that point of time. I sometimes look how my life has turned since that time and now I am one of the devs in a team which work on a product that itself is a browser extension. :)

So my data structure's exam's result came and i got scored 57.5 out of 80. My classmates who barely know anything about C scored way more than me. I am so embarrassed at myself but i gave the right answers in exam. My score in the exams before was 39/40 and 38.5/40. All my hardwork failed because it was a so called THEORY exam where there was only 2 small questions of writing algos but all others were just like "describe pre-order traversal of a binary tree" or "write the difference between a tree and a graph?define adjacent node, path and complete graph"...
When will this fuckery end?

Girl: "Professor I don't really understand the algorithm. Can you please write it on the board again?"
Professor writes down the alphabet.
Girl: "I don't get it."
We were talking about traversing a Binary search tree in Inorder traversal.

Googling how to electromagnetically shield a espruino project from neodymium magnets over lunch, and that leads on a trail of manipulating and directing em fields...

"What are you doing? That doesn't look anything like a binary tree structure in Java... What the hell is all that?"

"Uhm... Personal research?"

Just had an interview on a CS graduate from a top university with several years industrial experience who cannot even write pseudocode to rotate a binary tree. What is wrong with this world?

It is Saturday 19:30 and I am spending my time writing functions for save/load data in a binary tree. Recursion and fscanf are not a good combo so far, but that is the task. When the code is done I have to get some math done.

TSA questions for screening software engineers: Sunday an engineer from Nigeria got screened on if they were really a coder with googled questions like "write a function to check if a Binary Search Tree is balanced." What questions should they really be asking?

If you think root is at the top of the tree not at the bottom then you're already my close friend.
#CodingForLife

So my latest assignment's having me write a recursive method that can traverse a binary tree and return the data in a List. The catch? I can't pass anything in and I can't make any new instance variables.

How and why

Do all devs know how to write these Goolgle/Amazonesq algorithms off the top of their heads? ex: build singly linked list from scratch / pre or post binary tree traversals etc..