Here it comes: abstract class TreeNode implements Iterable<TreeNode> { private Set<TreeNode> children; public TreeNode() { children = new HashSet<TreeNode>(); } public boolean addChild(TreeNode n) { return children.add(n); } public boolean removeChild(TreeNode n) { return children.remove(n); } public Iterator<TreeNode> iterator() { return children.iterator(); } } I am well trusted, but haven’t tested the implementation.
I just stumbled on this as well, and spent some time learning how to generate a call graph (the normal results of cProfile is not terribly informative). Future reference, here’s another way to generate a beautiful call-tree graphic with cProfile + gprof2dot + graphViz. ——————— Install GraphViz: http://www.graphviz.org/Download_macos.php easy_install gprof2dot Run profile on the code. … Read more
GitHub’s website currently seems to be: Using blob for files, and tree for directories, in URLs; Redirecting browsers which request file URLs containing tree to contain blob instead; and Redirecting browsers which request directory URLs containing blob to URLs containing tree instead. It’s possible that GitHub’s website, at the time you asked the question, was … Read more
import java.util.ArrayList; import java.util.List; public class Node<T> { private List<Node<T>> children = new ArrayList<Node<T>>(); private Node<T> parent = null; private T data = null; public Node(T data) { this.data = data; } public Node(T data, Node<T> parent) { this.data = data; this.parent = parent; } public List<Node<T>> getChildren() { return children; } public void setParent(Node<T> … Read more
You can use recursion. We swap the left and right child of a node, in-place, and then do the same for its children: static void reverseTree(final TreeNode root) { final TreeNode temp = root.right; root.right = root.left; root.left = temp; if (root.left != null) { reverseTree(root.left); } if (root.right != null) { reverseTree(root.right); } } … Read more
For the benefit of anybody else reading this thread who doesn’t have access to the book mentioned in the accepted answer, here is what I hope will be an acceptable descriptive answer. Rotating puts the tree in a state where it meets the criteria to recolor (the child node has a red uncle). There are … Read more
Assuming this is some kind of homework and you want to do it yourself.. I did this once, you need a stack So what you do for the example is: parse what to do? Stack looks like ( push it onto the stack ( 5 push 5 (, 5 + push + (, 5, + … Read more
Let’s call the endpoint found by the first BFS x. The crucial step is proving that the x found in this first step always “works” — that is, that it is always at one end of some longest path. (Note that in general there can be more than one equally-longest path.) If we can establish … Read more
Since I didn’t found complete answer here. Here it is: Windows CMD doesn’t support -L depth levels. Install CygWin https://www.cygwin.com. In Cygwin make sure you pick Utilities / Tree package installed. Open CygWin and navigate to your folder, like cd ../../cygdrive/c/myFolder. List tree structure and save as result.txt tree -L 3 >result.txt.
No, there is not a balanced binary tree in the stdlib. However, from your comments, it sounds like you may have some other options: You say that you want a BST instead of a list for O(log n) searches. If searching is all you need and your data are already sorted, the bisect module provides … Read more