tree-traversal

You’re incorrectly printing the node’s value twice. You don’t need to check node->mid, as this is checked inside inorder(node->mid);. inorder(node) { if (node) { inorder(node->left); print(“%d “, node->value); inorder(node->mid); inorder(node->right); } } 0 solved Recursive and non-recursive traversal of three degree tree