Question

Given the following 234 TreeNode. How to implement the inOrder Traversal for this 234 Tree?

public class Tree24Node<E extends Comparable<E>> {
  public ArrayList<E> elements = new ArrayList<E>(3);
  public ArrayList<Tree24Node<E>> child = new ArrayList<Tree24Node<E>>(4);
  public Tree24Node() {
  }
  public Tree24Node(E e) {
    elements.add(e);
  }
}

Answer 1

import java.util.ArrayList;

public class Tree24Node<E extends Comparable<E>> {
    public ArrayList<E> elements = new ArrayList<E>(3);
    public ArrayList<Tree24Node<E>> child = new ArrayList<Tree24Node<E>>(4);

    public Tree24Node() {
    }

    public Tree24Node(E e) {
        elements.add(e);
    }

    public void inOrder() {
        if (child.get(0) != null) child.get(0).inOrder();
        System.out.println(elements.get(0));
        if (child.get(1) != null) child.get(1).inOrder();
        System.out.println(elements.get(1));
        if (child.get(2) != null) child.get(2).inOrder();
        System.out.println(elements.get(2));
        if (child.get(3) != null) child.get(3).inOrder();
    }
}