This flashcard is just one of a free flashcard set. See all flashcards!
3
TreeNode
public Tree getLeft(){
Tree t = new Tree();
t.root = root.left;
}
public void setLeft(Tree t){
left = t.root;
}
public void insert(int wert){
TreeNode parent= null;
TreeNode child = root;
if (child == null){
root = new TreeNode (wert, null, null);
return;
}
while (child != null){
Tree t = new Tree();
t.root = root.left;
}
public void setLeft(Tree t){
left = t.root;
}
public void insert(int wert){
TreeNode parent= null;
TreeNode child = root;
if (child == null){
root = new TreeNode (wert, null, null);
return;
}
while (child != null){

Flashcard info:
Author: hristiana86
Main topic: Informatik
School / Univ.: HS
City: Mannheim
Published: 14.06.2010