>Stop right there, you look suspicious
>Prove you belong on Sup Forums by balancing this binary search tree
what do?
Stop right there, you look suspicious
Evan Miller
Other urls found in this thread:
yro.slashdot.org
twitter.com
Jayden Gutierrez
>lol you tk him 2 da bar
Gavin Stewart
He only had to verify that the binary tree is balanced. Just count left and right leafs recursively.
Aaron Myers
>giving away your powerlevel
Sorry, but who is this guy called Four Chan?
Jose Long
Hack the airport and crash all planes with no survivors
Christian Lewis
I can't. I come here to shill Intel and Nvidia and Apple.
Owen Brown
I laughed harder than I should have.
Michael Gray
makes no sence cause its a 50% chance you get it right and 50% chance you get it wrong.
Dylan Thomas
>my apologies sir, heres my military id
>oh, have a good day sir. thank you for your service
easy
Thomas Powell
First I go through the three using inorder traversal and save every node in an array. Then I take the middle element of the array and make it the root node and make the left subtree from the left subarray of the middle element and the right subtree from the right subarray.
Isaac Watson
>scream racism
Brayden Martin
wtf? is that even real or just gibberish
Ryder Murphy
>>/out/
Carter Russell
he's just a moron. ignore him.
the easiest answer is avl or red-black tree.
balanced enough.
to determine balance is literally asserting that all leaves--or lack thereof, are at the same level of depth.
Chase Garcia
TFW the TSA Agent told the Engineer his answer was wrong
Jacob Rodriguez
okay so i uhm bitshift everything using ~ operator and then uhhh i print fizzbuzz and then i uhmmmm
hold on let me check out my java booklet
Aaron Williams
Sure, let me do a preorder traversal.
Brandon Mitchell
I have no clue what this means therefore I definitely belong here
Henry Kelly
...
Noah Morris
The only question I would have is "How balanced?"
Either you write the function to return a 2-tuple representing a rational of balanced-ness, or you write a function that says "yes/no" based on whether literally every node has either zero or two leaves.
If I wanted a balanced tree I'd just use AVL trees though.
Owen Torres
>He didn't know why manhole covers are round
>deport him
Jaxson Ramirez
that's it? You aren't going to impose how it has to be done or give me the time complexity of my solution? Christ the wall cannot come soon enough
Sebastian Cooper
>AVL tree
Shit tier, barely better than a linked list.
>Red-black tree
Acceptable, good worst case performance, but poor average performance.
>B-tree
God-tier data structure offering excellent performance with any access pattern
Aiden Bailey
>muh thinkpad
>muh open sauce software
Isaiah Scott
>barely better than a linked list.
>O(logn) is barely better than O(n) when searching
Kayden Thompson
Have you tried turning it on and off again?
EZ