huffman-encoding/BinaryTreeNode.java at master · anton2mihail/huffman-encoding · 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
public class BinaryTreeNode<T> {

   private T element;
   private BinaryTreeNode<T> left, right;

   BinaryTreeNode (T element) {

      this.element = element;
      left = null;
      right = null;
   }

   public T getElement() {

	   return element ;
   }

   public void setElement(T element) {

	   this.element = element ;
   }

   public BinaryTreeNode<T> getRight() {

	   return right ;
   }

   public BinaryTreeNode<T> getLeft() {

	   return left ;
   }

   public void setRight(BinaryTreeNode<T> right) {

	   this.right = right ;
   }

   public void setLeft(BinaryTreeNode<T> left) {

	   this.left = left ;
   }

   public boolean isLeaf() {

	   return left == null && right == null ;
   }

   public int numChildren() {
      int children = 0;

      if (left != null)
         children = 1 + left.numChildren();

      if (right != null)
         children = children + 1 + right.numChildren();

      return children;
   }
}