package tree;
 
class Main {
 
    public static void main(String[] args) {
        TreeNode<String> treeRoot = getSet1();
        
        printTree(treeRoot);
        
        /*for (TreeNode<String> node : treeRoot) {
            String indent = createIndent(node.getLevel());
            System.out.println(indent + node.data);
        }*/
    }
 
    public static void printTree(TreeNode<String> tree) {
 
????????????????????????????????????????????????????????? - как здесь написать рекурсию 
        
    }
    
    private static String createIndent(int depth) {
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < depth; i++) {
            sb.append(' ');
        }
        return sb.toString();
    }
 
    public static TreeNode<String> getSet1() {
        TreeNode<String> root = new TreeNode<>("root");
 
        TreeNode<String> node0 = root.addChild("Video");
        TreeNode<String> node1 = root.addChild("Music");
        TreeNode<String> node2 = root.addChild("Pictures");
 
        TreeNode<String> node00 = node0.addChild("Terminator");
        TreeNode<String> node01 = node0.addChild("Batman");
        TreeNode<String> node02 = node0.addChild("Harry Potter");
        TreeNode<String> node03 = node1.addChild("Kendrick Lamar");
        TreeNode<String> node04 = node1.addChild("Oxxxymiron");
        TreeNode<String> node05 = node1.addChild("Lana Del Rey");
        TreeNode<String> node06 = node2.addChild("Comics");
        TreeNode<String> node07 = node2.addChild("Mona Lisa");
        TreeNode<String> node08 = node2.addChild("Picasso");
        
        
        TreeNode<String> node09 = node08.addChild("Picasso1");
        TreeNode<String> node10 = node08.addChild("Picasso2");
 
        return root;
 
    }
}

package tree;

import tree.Tree.Node;

public class Main {

    public static void main(String[] args) {
        Tree<String> rootFolder = new Tree<>("RootFolder"); // ----------- только она может быть Tree
        Node<String> video = new Node<>("Video", rootFolder.getNode()); //------------- В вашем коде оно Tree, нужно чтобы было Node, чтобы одно дерево было и от него должны идти ноды
        Node<String> music = new Node<>("Music", rootFolder.getNode()); // ---------- В вашем коде оно Tree, нужно чтобы было Node, чтобы одно дерево было
        Node<String> picture = new Node<>("Picture", rootFolder.getNode()); // ---------- В вашем коде оно Tree, нужно чтобы было Node, чтобы одно дерево было
        rootFolder.add(video);
        rootFolder.add(music);
        rootFolder.add(picture);
        Node<String> terminator = new Node<>("Terminator", video);
        Node<String> dieHard = new Node<>("Die Hard", video);
        Node<String> rocky = new Node<>("Rocky", video);
        Node<String> abby = new Node<>("Abba", music);
        video.add(terminator);
        video.add(dieHard);
        video.add(rocky);
        music.add(abby);
        Node<String> homePicture = new Node<>("Home picture", picture);
        Node<String> workPicture = new Node<>("Work picture", picture);
        picture.add(homePicture);
        picture.add(workPicture);

        int foundForNameInDirectory = rootFolder.findByName("Abba").size();
        System.out.println("found for name in directory - " + foundForNameInDirectory);
        // found for name in directory - 1
        System.out.println("root node name - " + rootFolder.findByName("Abba").get(0).getRoot().getData());
        // root node name - RootFolder
    }
}

package tree;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;

public class Tree<T> {
    private Node<T> root;

    public Tree(T rootData) {
        root = new Node<T>(rootData, null);
        root.data = rootData;
        root.children = new ArrayList<Node<T>>();
    }

    public static class Node<T> {
        private T data;
        private Node<T> parent;
        private List<Node<T>> children;

        public Node(T data, Node<T> parent) {
            this.data = data;
            this.parent = parent;
            this.children = new ArrayList<Node<T>>();
        }

        public void add(Node<T> node) {
            children.add(node);
        }

        public T getData() {
            return data;
        }

        public List<Node<T>> iterate() {
            return children;
        }

        public Node<T> getRoot() {
            if (parent == null) {
                return null;
            }
            Node<T> localParent = parent;
            while (localParent.parent != null) {
                localParent = parent.parent;
            }
            return localParent;
        }

    }

    public Node<T> getNode() {
        return root;
    }

    public List<Node<T>> iterate() {
        return root.children;
    }

    public boolean remove(Node<T> node) {
        return root.children.remove(node);
    }

    public void add(Node<T> node) {
        root.children.add(node);
    }

    public List<Node<T>> findByName(final String name) {
        final List<Node<T>> result = new ArrayList<>();
        final Queue<Node<T>> allFiles = new LinkedList<>();
        allFiles.add(getNode());
        while (!allFiles.isEmpty()) {
            final Node<T> localEntry = allFiles.poll();
            final List<Node<T>> files = localEntry.iterate();
            for (final Node<T> innerFile : files) {
                if (innerFile.getData().equals(name)) {
                    result.add(innerFile);
                }
                allFiles.add(innerFile);
            }
        }
        return result;
    }
}

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package treeadil;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;


public class TreePrint {
	
    public static void main(String[] args) {
        Tree<String> rootFolder = new Tree<>("RootFolder"); 
        Node<String> video = new Node<>("Video", rootFolder.getNode()); 
        Node<String> music = new Node<>("Music", rootFolder.getNode()); 
        Node<String> picture = new Node<>("Picture", rootFolder.getNode());
        rootFolder.add(video);
        rootFolder.add(music);
        rootFolder.add(picture);
        Node<String> terminator = new Node<>("Terminator", video);
        Node<String> dieHard = new Node<>("Die Hard", video);
        Node<String> rocky = new Node<>("Rocky", video);
        Node<String> abby = new Node<>("Abba", music);
        video.add(terminator);
        video.add(dieHard);
        video.add(rocky);
        music.add(abby);
        Node<String> homePicture = new Node<>("Home picture", picture);
        Node<String> workPicture = new Node<>("Work picture", picture);
        picture.add(homePicture);
        picture.add(workPicture);

        int foundForNameInDirectory = rootFolder.findByName("Abba").size();
        System.out.println("found for name in directory - " + foundForNameInDirectory);
        
        System.out.println("root node name - " + rootFolder.findByName("Abba").get(0).getRoot().getData());
        
        
       
        printCatalog(rootFolder);
    }

	private static <T> void printCatalog(Tree<T> rootFolder) {
		
		 printNode(rootFolder.getNode());
		 List<Node<T>> kids = rootFolder.iterate();
		 printKids(kids);

	}

	private static <T> void printKids(List<Node<T>> kids) {
		 if (kids.isEmpty()) return;
		 for (Node<T> kid:kids) {
			printNode(kid);
			printKids(kid.children);
		 }
		
	}

	private static <T> void printNode(Node<T> kid) {
		 System.out.println(kid.getData());
		
	}
}

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package treeadil;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;

class Tree<T> {
	    private Node<T> root;

	    public Tree(T rootData) {
	        root = new Node<>(rootData, null);
	        root.data = rootData;
	        root.children = new ArrayList<Node<T>>();
	    }


	    public Node<T> getNode() {
	        return root;
	    }

	    public List<Node<T>> iterate() {
	        return root.getChildren();
	    }

	    public boolean remove(Node<T> node) {
	        return root.children.remove(node);
	    }

	    public void add(Node<T> node) {
	        root.children.add(node);
	    }

	    public List<Node<T>> findByName(final String name) {
	        final List<Node<T>> result = new ArrayList<>();
	        final Queue<Node<T>> allFiles = new LinkedList<>();
	        allFiles.add(getNode());
	        while (!allFiles.isEmpty()) {
	            final Node<T> localEntry = allFiles.poll();
	            final List<Node<T>> files = localEntry.iterate();
	            for (final Node<T> innerFile : files) {
	                if (innerFile.getData().equals(name)) {
	                    result.add(innerFile);
	                }
	                allFiles.add(innerFile);
	            }
	        }
	        return result;
	    }
	}

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package treeadil;

import java.util.ArrayList;
import java.util.List;

public class Node<T> {

    private T data;
    private Node<T> parent;
    private List<Node<T>> children;

    public Node(T data, Node<T> parent) {
        this.data = data;
        this.parent = parent;
        this.children = new ArrayList<>();
    }

    public void add(Node<T> node) {
        children.add(node);
    }

    public T getData() {
        return data;
    }

    public List<Node<T>> getChildren() {
        return children;
    }

    
    public List<Node<T>> iterate() {
        return children;
    }

    public Node<T> getRoot() {
        if (parent == null) {
            return null;
        }
        Node<T> localParent = parent;
        while (localParent.parent != null) {
            localParent = parent.parent;
        }
        return localParent;
    }

}