DSA-ALGORITHMS/BinaryTree.java at main · iamaunique/DSA-ALGORITHMS · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
public class BinaryTree {
    TreeNode root;

    public void setRoot(TreeNode root) {
        this.root = root;
    }

    public TreeNode getRoot() {
        return root;
    }


    public void frontShow(){
        if(root!=null){
            root.frontShow();
        }
    }
    public void midShow(){
        if(root!=null){
            root.midShow();
        }
    }
    public void afterShow(){
        if(root!=null){
            root.afterShow();
        }
    }
    public TreeNode frontSearch(int i){
        return root.frontSearch(i);
    }
    public void delete(int i){
        if(root.value == i){
            root = null;
        }
        else{
            root.delete(i);
        }
    }
}