Advertisement
Guest User

Untitled

a guest
Jan 21st, 2018
4
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.24 KB | None | 0 0
  1.  public static void main(String[] args) {
  2.         TREE<Integer> baseTree = new TREE();
  3.         baseTree.insert(65);
  4.         baseTree.insert(54);
  5.         baseTree.insert(85);
  6.         baseTree.insert(19);
  7.         baseTree.insert(60);
  8.         baseTree.insert(80);
  9.         baseTree.insert(89);
  10.         baseTree.insert(8);
  11.         baseTree.insert(35);
  12.         baseTree.insert(70);
  13.         baseTree.insert(83);
  14.  
  15.         List<Integer> list = getBaseNodes(baseTree);
  16.         for (Integer i : list) {
  17.             System.out.println(i + " ");
  18.         }
  19.  
  20.     }
  21.  
  22.     public static List<Integer> getBaseNodes(TREE<Integer> baseTree) {
  23.         List<Integer> list = new ArrayList<>();
  24.         return getBaseNodesAux(baseTree.root, 0, baseTree.height(), list);
  25.     }
  26.  
  27.     private static List<Integer> getBaseNodesAux(Node node, int currentLevel, int height, List<Integer> list) {
  28.         if (node == null) {
  29.             return null;
  30.         }
  31.  
  32.         if (height + 1 == currentLevel) {
  33.             list.add((Integer) node.getElement());
  34.             return list;
  35.         }
  36.  
  37.         getBaseNodesAux(node.getRight(), (currentLevel + 1), height, list);
  38.         getBaseNodesAux(node.getLeft(), (currentLevel + 1), height, list);
  39.         return list;
  40.     }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement