Kokocksmülsch

//============================================================================
// Name        : Binärbaum.cpp
// Author      : Kevin Danielowski
// Version     : 1.0
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
using namespace std;

struct knoten{
		int wert;
		knoten* left;
		knoten* right;
	};

void addKnoten(knoten* node, int value)
{
	knoten* parent = NULL;

	while (node != NULL)
	{
		if (value == node->wert
			return;

		parent = node;
		if(value < node->wert)
			node = node->left;
		else if(value > node->wert)
			node = node->right;
	}

	node = new knoten();
	node->wert = value;
	node->left = NULL;
	node->right = NULL;



}

void inOrder(knoten* node)
{

}

knoten* findKnoten(knoten* node, int value)
{

	return NULL;
}

void delKnoten(knoten* node, int value)
{

}


int main() {

	knoten* wurzel = new knoten();
	wurzel->wert = 50;
	wurzel->left = NULL;
	wurzel->right = NULL;

	addKnoten(wurzel, 30);







}