A Tree is just a restricted form of a Graph. Trees have direction (parent / child relationships) and don’t contain cycles. They fit with in the category of Directed Acyclic Graphs (or a DAG). So Trees are DAGs with the restriction that a child can only have one parent. One thing that is important to … Read more
Look at the first error message of the compiler. It should complain about the *char in line 6, which should be char *. By the way: always copy and paste error messages, so that we get the original messages.
Consider these three rules: Transform any 2-node in the 2-3-4 tree into a black node in the red-black tree. Transform any 3-node into a child node and a parent node. The child node has two children of its own: either W and X or X and Y. The parent has one other child: either Y … Read more
The number of leaf nodes in a full binary tree with n nodes is equal to (n+1)/2. Refrence to the above formula.
The absolute best case happens when we just check every element and see that the data’s already sorted. This will result in n-1 comparisons and thus the leaf will have a depth of n-1. Practically, this happens for insertion sort (which isn’t all that good otherwise though). Does it change depending on the algorithm? Absolutely. The best case of an … Read more
There are two reasons you could want to use a tree: You want to mirror the problem using a tree-like structure:For this we have boost graph library Or you want a container that has tree like access characteristics For this we have std::map (and std::multimap) std::set (and std::multiset) Basically the characteristics of these two containers is such that they practically … Read more
Sure – you simply can’t apply the > operator between objects. What would you expect it to do? You can’t apply any of the other binary operators either – +, -, / etc (with the exception of string concatenation). Ideally, you should make your TreeNode generic, and either have a Comparator<T> which is able to compare any two instances, or make T extend Comparable<T>. Either way, … Read more
I am just wondering if someone might be able to clarify the definition of a balanced tree for me. I have that “a tree is balanced if each sub-tree is balanced and the height of the two sub-trees differ by at most one. I apologize if this is a dumb question, but does this definition … Read more
I learned that depth and height are properties of a node: The depth of a node is the number of edges from the node to the tree’s root node.A root node will have a depth of 0. The height of a node is the number of edges on the longest path from the node to a leaf.A leaf node will have a … Read more
Is there any standard Java library class to represent a tree in Java? Specifically I need to represent the following: The sub-tree at any node can have an arbitrary number of children Each node (after the root) and it’s children will have string value I need to get all the children (some sort of list … Read more