If a node has no left or right node, you know that the deepest full level is 1 – the node itself. If it has left and right nodes, recurse and choose the smaller. highestFull(BinaryNodeX<Comparable> *t) { if ( ! t->left || ! t->right ) return 1; return 1 + std::min( highestFull(t->left), highestFull(t->right) ); } … Read more
You are passing prefix_exp_str[1:] to both the recursive calls. Instead, the second recursive call needs to receive whatever is left of the input string after the first recursive call is finished. solved Creating an expression tree for prefix expression
Why isn’t std::set just called std::binary_tree? Because Tree doesn’t describe how the interface is used. Set does. std::set does not provide sufficient operations to be used as a general purpose search tree. It only provides an interface to a particular application of a search tree: The representation of a set. Technically the standard doesn’t specify … Read more
insert_recursively does not return a value when it goes into else block however you store the returned value (garbage) in right_linker or left_linker anyway. Note that compiler issues a corresponding warning: warning C4715: ‘insert_recursively’: not all control paths return a value 1 solved wrong result in Visual Studio
Your code invoke UB. tree_node *root; … c=b.search(root,number); // root is uninitialized To solve this add a new function: class bst { … int search(tree_node * ,int); int search(int v) { return search(root, v); } }; Also in bst::search function: else //if (root != NULL){ Comment this condition if(root->data == data) { // r=”t”; return … Read more
Your problem is that while the generic parameter of TreeNode is Comparable, the class itself is not. Change this: public static class TreeNode<E extends Comparable<E>> { To this: public static class TreeNode<E extends Comparable<E>> implements Comparable<TreeNode<E>> { Or if you don’t require the generic type to also be Comparable: public static class TreeNode<E> implements Comparable<TreeNode<E>> … Read more
I don’t understand why all the data gets printed in the arrange method correctly but does not get printed in the print method solved I don’t understand why all the data gets printed in the arrange method correctly but does not get printed in the print method