如何递归删除JTree中的所有节点？

Question

in a JTree comprised of DefaultMutableTreeNodes , how would you traverse and delete starting from a given Node and all it's ancestors?

it should delete starting at it's deepest level , backing upwards to the given Node. the given starting node should be the last thing to remove.

Answer 1

Recursion is your friend here.

In pseudo code:

def deleteTree(root)
    for each child c of root
        deleteTree(c)
    end
    delete root
end