gistfile1.java

TreeItem findStack(TreeItem root, Object obj) {
       Deque<TreeItem> stack = new ArrayDeque<TreeItem>();
       stack.push(root);
       while (!stack.isEmpty()) {
              TreeItem currentItem = stack.pop();
              if (Objects.equals(currentItem.getData(), obj)) {
                return currentItem;
              }
              for (TreeItem child : currentItem.getChildren()) {
                stack.push(child);
              }
       }
       return null;
}