Calculate Time complexity of this algorithm...

[Rxd]

Im a retard

 

Didn't notice that this was in the spam/off topic section >.> 

 

Apologies lads, feel free to spam

Those deleted posts

[Decode]

Those deleted posts

 

 

Sorry

[Explv]

No more spamming this thread please. Next person to post an irrelevant comment will be punished. 

 

 

But its in spam ?

 

 

Why was this thread moved to Spam? It was originally in the Programming section.

 

Maybe we should have a programming questions section in there if this is considered off topic?

[Decode]

Why was this thread moved to Spam? It was originally in the Programming section.

 

Maybe we should have a programming questions section in there if this is considered off topic?

 

It wasn't in spam?  

[Explv]

It wasn't in spam?

 

No

[Jake]

Why was this thread moved to Spam? It was originally in the Programming section.

 

Maybe we should have a programming questions section in there if this is considered off topic?

 

I havent seen this post when it went up but it says spam when i got to it. 

[Explv]

I havent seen this post when it went up but it says spam when i got to it.

I don't follow the spam section, I do follow the programming section however, which is how I saw the thread in the first place. I may be wrong but I'm pretty sure it was in programming

[Jordan]

I don't follow the spam section, I do follow the programming section however, which is how I saw the thread in the first place. I may be wrong but I'm pretty sure it was in programming

I think it was moved. OP would have gotten notification.

[Qubit]

Can confirm it was moved by Alek from programming to spam

[Jordan]

Sorry op 

[Swizzbeat]

https://gist.github.com/jaavant/5ae6f6296ce720bd43591f678fa8762e

I normally don't code bash but jesus fuck this is terrible.

[Qubit]

I normally don't code bash but jesus fuck this is terrible.

 

 I mean it wasn't supposed to be coded, and i tossed it together to prove the complexities. What's so bad about it?

[Krys]

free 

[Swizzbeat]

 I mean it wasn't supposed to be coded, and i tossed it together to prove the complexities. What's so bad about it?

I don't think you understand what a tree data structure is. Tree's have explicit parent pointers with a set of children (which makes up each "branch"). You defined a linked list, not a tree. On top of that you explicitly defined value as an int which is just lazy considering there are easy to implement generic types.

[Qubit]

I don't think you understand what a tree data structure is. Tree's have explicit parent pointers with a set of children (which makes up each "branch"). You defined a linked list, not a tree. On top of that you explicitly defined value as an int which is just lazy considering there are easy to implement generic types.

 

 

I've used this data structure plenty of time to represent a binary tree. The basic data structure consisting of a value, leftChild, rightChild is commonly used amongst programmers. So you are complaining about that? Secondly, i don't know if you could tell but this was an algorithm specific question, not a java one. My attempt was not to use language specifics, such that the algorithm was less dependent on a specific language. I mean if you just look at the problem, why would I go overkill and add generics if all the values at a node are ints.. Would you like me to check if the returning value was affected my overflow too  ? 

Edited December 31, 2016 by Qubit