>/g/ couldn't even write an algorithm to check if

homework thread

I could and I have.

>>58812455
No

>>58812455
I believe you.

t. not OP

/homework thread

File: beefy pc.jpg (385KB, 1280x960px) Image search: [Google]

385KB, 1280x960px

It shouldn't be hard


On a unrelated note, what do you guys think about my new home-server, I took an old PC I had

It acts as my personal storage cloud connected to the internet

File: ir8xcrtmh-g.jpg (38KB, 511x512px) Image search: [Google]

38KB, 511x512px

>>58814650

>>58814650
I've seen that before. Also, I tried something similar before, minus the foam. But it lasted about a year or two.

>>58812410
what's bst?

>>58814705
battlestation

>>58812410
As if checking is the hard part.
The only thing where you have to be clever is the rebalancing.

>>58814650
I thought that was a box with butcher waste like intestines

I could, but no one has yet offered to pay me to do it.

>>58812410
what's a BST?

>>58816848
Binary Search Tree.

I think that's point proven.

>>58812410
My battlestation got around 8/10, it's pretty balanced

Wouldn't you need some specific bound? I mean that just means that h <= klogn, but you would have to be given k. Like for an AVl tree it's ~1.4, for a RB-tree it's 2. For any arbitrary tree, you could just set k to be large enough and you could argue it's balanced...