igc_script_backup/BinaryTree.java at main · jexa/igc_script_backup · 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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
import java.util.LinkedList;


public class BinaryTree<E extends Comparable<E> & Filterable> {
	private BinaryTreeNode<E> root;

	public void add(E d)
	{
		if(root != null)
			root.add(d);
		else
			root = new BinaryTreeNode<E>(d,null);
	}


	public void remove(E d)
	{
		if(root != null)
		{
			if(root.getValue().compareTo(d) == 0)
			{

					if(root.hasLeft())
					{
						BinaryTreeNode<E> right = root.getRight();
						root = root.getLeft();
						root.setParent(null);
						BinaryTreeNode<E> most = root.getMost();
						most.setRight(right);
						if(right != null)
						{
							right.setParent(most);
						}
					}
					else if(root.hasRight())
					{
						BinaryTreeNode<E> left = root.getLeft();
						root = root.getRight();
						root.setParent(null);
						BinaryTreeNode<E> least = root.getLeast();
						least.setLeft(left);
						if(left != null)
						{
							left.setParent(least);
						}
					}
					else
						root = null;
			}
			else root.remove(d);
		}
	}

	public void inorder(LinkedList<E> list)
	{
		if(root != null)
			root.inorder(list);
	}

	public void postorder(LinkedList<E> list)
	{
		//System.gc();
		if(root != null)
			root.postorder(list);
	}

	public void inorder(LinkedList<E> list, E min, E max) {
		if(root != null)
		{
	//		System.gc();
			root.inorder(list,min,max);
		}

	}

	public void removeAll() {
		root = null;

	}
	/*
	public int filterExons()
	{
		int filtered = 0;
		if(root != null)
		{
			while(root != null)
			{
		//		if(root.getData().filter())
		//			remove(root.getData());
		//		else
		//		{
		///			boolean removed = root.filter(0);
		//			if(!removed) break;
		//		}
		//		filtered++;
			}
		}
		return filtered;
	}
	*/
	public E removeNextInOrder()
	{
		if(root != null)
		{
			if(root.getLeft() != null)
				return root.removeNextInOrder();
			else
			{
				E result = root.getData();
				remove(result);
				return result;
			}
		}
		else
			return null;
	}

	public E removeNextPostOrder()
	{
		if(root != null)
		{
			if(root.getRight() != null)
				return root.removeNextPostOrder();
			else
			{
				E result = root.getData();
				remove(result);
				return result;
			}
		}
		else
			return null;
	}

	public void print()
	{
		if(root !=null)
			root.print();
	}

}