traversing a non binary tree in java [closed]

Answer 1

In a non-binary tree, there will be a Vector or some other structure that has references to all the children. Make a recursive method as so:

public void traverse(Node child){ // post order traversal
    for(Node each : child.getChildren()){
        traverse(each);
    }
    this.printData();
}

Something along those lines.

Answer 2

The algorithm for pre-post order is the same as a binary tree.
There is no such thing as in-order traversal for a general tree i.e. does not make sense (unless you define some order)

Answer 3

Well, when traversing a binary tree, in preorder, you visit the parent node, then recursively traverse the left subtree then recursively traverse the right subtree. With a tree with more than two children, you recursively traverse the subtrees headed by each children. You would do the recursive calls in a for loop.

Answer 4

You'll need to use recursion since you can't determine how many children are at each node (breadth) or how far the tree goes (depth). Depending on how you want to traverse, you can use Breadth-first-search or Depth-first-search.

There is a ton of information on this topic, so give it an attempt to implement one of these recursive methods and please come back if you have trouble along the way!