Java Parameters and Inheritance question

Building a Red-Black Tree for a project. Right now I've got a working Binary Search Tree with constructors:

public class BSTree <T extends Comparable>{
    private BSTNode<T> root;
   
    public BSTree(){
    }
    public BSTree(BSTNode<T> n){
        root=n;
    }
    public BSTree(T c){
        root=new BSTNode<T>(c);
    }

And then I've got the Red-Black Tree's constructors:

public class RBTree <T extends Comparable> extends BSTree{
   
    public RBTree (){
        super();
    }
    public RBTree (T c){
        super(c);
    }
    public RBTree (BSTNode<T> n){
        super(n);
    }

My question: Will this handle Parameters correctly? Ex, if I make a RBTree<Integer>(), will it run BSTree<Integer>(), or just BSTree() ?

Sorry for Java faggotry, it's the only language my school teaches.

why don't you try it and share your results?

public static void main(String [] args){
        RBTree<Integer> r=new RBTree<Integer>();
        r.add(new Integer(4));
        Integer thisDoesntWork=r.getNode(new Integer(4)).getData();
    }

Gives a Type mismatch, so no, it doesn't work, and yes, I'm a fucking idiot for not actually trying it.

So does anybody know what I'm supposed to do for something like this? One thing I did try was looking it up, but I didn't find much on how parameters deal with inheritance.

extends BSTree<T>

Forget it, it's NP-complete.

NP-complete means its impossible to solve.

what the fuck are you trying to do

BSTree<Integer>(), or just BSTree()
it will run the constructor named BSTree(), and gives you a class where T is 'replaced' everywhere in it by Integer (saving you a shitload of typecasts)

>>5
But is it Touring-complete?

>>5
I'm surprised people still remember this.

You're missing parameterization somewhere if it's not returning Integer.

public class RBTree <T extends Comparable> extends BSTree{

try changing BSTree to BSTree<T> or BSTree<T extends Comparable>

Java really is a shitty language.

Java is nasty

>>6
No, it doesn't. I can just enumerate all possible solutions.

>>6
NP-complete means the problem grows exponentially with respect to the input, so it quickly becomes intractable.

Many of today's frequently solved problems are NP-complete. An acceptable solution can be found in acceptable time given the input.

>>12-14
Give it up, this discussion is NP-complete.

>>12
>>13
no, NP complete means that its unsolveable. GIven an NP complete problem its not intractable to any solvable problem, therefore its unsolveable.
Go read wikipedia if you are confused.

>>16
You're the one who's confused pal. NP complete means that finding a complete solution takes a non-polynomial amount of time.

>>17
stop arguring and read what you are actually saying. Its obvious you dont know what you are talking about.
We are discussing "NP completeness", please read about it to the point that you know what it is before trying to discuss it with us.

>>18
If you're attempting to troll me, you have succeeded. Otherwise you're just annoyingly stupid.

>>19
The N in NP-complete means nondeterministic, which means that you cannot determine the answer to the problem.  Not even Touring-complete languages like BBcode, maybe Perl though.

>>20
How do I solved NP-complete problem?

while True:
    solution = give_random_solution()
    if is_answer_correct(solution):
        return solution

>>21
One word, the forced indentation of code, NP-complete.

>>21
it's better to do give_next_solution() instead. that way you won't repeat the same solution more than once.

>>23
The solutions for an NP complete problem may be innerable, and theres no heuristic to iterativly travel toward a solution. This is the fundamental nature of NP complete problem, and its why the are unsolveable.

>>24
But you can still establish an order of operation instead of bothering to take random choices (slower, and chance of repeating your choices).

>>25
The classic NP complete problem is the travelling salesman. The solution is to enumerate all possible routes. There is no way to say that any given route is the shortest without enumerating all of them.

>>26
Of course, I'm just talking about proceeding in some order (any order), instead of doing it randomly (which is more costly and can be redundant).

Hi, >>27 here. I'll auto-own myself with this paragraph from Wikipedia:

Random path change algorithms are currently the state-of-the-art search algorithms and work up to 100,000 cities. The concept is quite simple: Choose a random path, choose four nearby points, swap their ways to create a new random path, while in parallel decreasing the upper bound of the path length. If repeated until a certain number of trials of random path changes fail due to the upper bound, one has found a local minimum with high probability, and even further it's a global minimum with high probability (whereas high means that the rest probability decreases exponentially in the size of the problem - thus for 10,000 or more nodes, the chances of failure is negligible).

>>28
OK can we just accept that NP problems are unsolvable now that you have read wikipedia.

Random PATH change algorithms are currently the STATE-OF-THE-ART search AL-gorithms and work up to 100,000 CITIES. The CON-cept is quite SIM-ple: Choose a random PATH, choose four NEAR-BY points, SWAP their WAYS to create a NEW random path, while in PARA-llel DE-creasing the UPPER bound of the path LENGTH.

>>30
THIS IS WHY WE DON'T SUBMIT /prog/ TO REDDIT

IF U WERE DROPPED TO /opt TOMORROW, I WOULDNT GO 2 UR DELETION CUZ ID B N UPSTREAM BUGZILLA

FLAMIN DA CUNT THAT MADE UR EBUILD!
     __   
   .'  `. 
   |a_a  |
   \<_)__/
   /(   )\
  |\`> < /\
  \_|=='|_/
WE TRUE NERDS
WE OPTIMIZE OUR CFLAGS TOGETHER
WE TALKIN ON IRC WITH www.opera.com TOGETHER
send this PENGUIN to every thread you care about including this one if you care. C how many

times you get this, if you get 256 your A TRUE NERD

>>31
THIS IS WHY WE DON'T SUBMIT /prog/ TO REDDIT

LISP

^{Back to /b/, ``GNAA Faggot''}

Don't change these.

Name:		Email:
Entire Thread Thread List