Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Tree {
- Node wurzel;
- public Tree() {
- wurzel=null;
- }
- public void insert(int z) {
- Node neu = new Node(z);
- Node counter = wurzel;
- if(wurzel==null) {
- wurzel = neu;
- }
- else {
- if(z==counter.getNumber()) {
- System.out.println("Diese Zahl gibt es leider schon^^");
- }
- while(z<counter.getNumber()) {
- if(counter.l==null) {
- counter.l = neu;
- }
- else {
- counter = counter.getLeft();
- }
- }
- while(z>counter.getNumber()) {
- if(counter.r==null) {
- counter.r = neu;
- }
- else{
- counter = counter.getRight();
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement