Find the last element of the binary tree with the minimum value

Quote:

How to make not only the minimum number, but also the symbol together with the number,

the problem :

int main()
{
	int N, min = 9999999999; // Note that min is unused in main
	cout << "Enter nodes count: "; cin >> N;
	Node* root = CreateTree(N);
	cout << endl;
	PrintTree(root, 0);
	cout << "Infix search: ";
	cout << endl << InfixOrder(root, min); cout << endl;
	return 0;
}
Info InfixOrder(Node* root, Info& min)
{
	if (root != NULL)
	{
		InfixOrder(root->left, min);
		cout << root->info << " ";
		cout << root->ch << "   ";
		InfixOrder(root->right, min);
		if (root->info < min)
			min = root->info;
	}
	return min; // Here you are loosing the link to ch
}

First solution : create a second InfixOrder function to return ch.
Second solution : return a pointer to the node with minimum value.

[UpDate]
Many more errors

cout << endl << InfixOrder(root, min); cout << endl; // here you print the result
InfixOrderNew(root, min, ch); // then here you call the new function

replace with

InfixOrderNew(root, min, ch);
cout << endl << min << ch << endl;

Then in

Info InfixOrderNew(Node* root, Info& min, char& ch)
{
	if (root != NULL)
	{
		InfixOrderNew(root->left, min, ch);
		cout << root->info << " ";
		cout << root->ch << "   ";
		InfixOrderNew(root->right, min, ch);
		if (root->info < min)
			min = root->info;
	}
	return ch;
}

Where are you setting the value of ch ?

Your code do not behave the way you expect, or you don't understand why !

There is an almost universal solution: Run your code on debugger step by step, inspect variables.
The debugger is here to show you what your code is doing and your task is to compare with what it should do.
There is no magic in the debugger, it don't know what your code is supposed to do, it don't find bugs, it just help you to by showing you what is going on. When the code don't do what is expected, you are close to a bug.
To see what your code is doing: Just set a breakpoint and see your code performing, the debugger allow you to execute lines 1 by 1 and to inspect variables as it execute.

Debugger - Wikipedia, the free encyclopedia[^]

Mastering Debugging in Visual Studio 2010 - A Beginner's Guide[^]
Basic Debugging with Visual Studio 2010 - YouTube[^]

1.11 — Debugging your program (stepping and breakpoints) | Learn C++[^]

The debugger is here to only show you what your code is doing and your task is to compare with what it should do.

void InfixOrder(Node* root, Info& min, char &ch);

I would also initialize min with INT_MAX.

Thanks everyone for help, but i have last question)
When i inputted this:
Input:
Enter nodes count: 7
Enter node value: 35
Enter node symbol: a
Enter node value: 38
Enter node symbol: b
Enter node value: 22
Enter node symbol: c
Enter node value: 24
Enter node symbol: d
Enter node value: 56
Enter node symbol: n
Enter node value: 59
Enter node symbol: m
Enter node value: 22
Enter node symbol: x

22x
56n
59m
35a
24d
38b
22c

i got this result
result:
Infix search: 22c 38b 24d 35a 59m 56n 22x
22c

22c is the first element of the binary tree with the minimum value, and I need the answer to be 22x, because I need to find the last element of the binary tree with the minimum value.

But if I type like this:
Enter node value: 22
Enter node symbol: c
Enter node value: 35
Enter node symbol: a
Enter node value: 38
Enter node symbol: b
Enter node value: 24
Enter node symbol: d
Enter node value: 56
Enter node symbol: n
Enter node value: 22
Enter node symbol: x
Enter node value: 59
Enter node symbol: m

59m
56n
22x
22c
24d
35a
38b

then the result will be as it should be:
Infix search: 38b 35a 24d 22c 22x 56n 59m
22x

because 22x is the last element of the binary tree with the minimum value that i need to find
Why so?
perhaps because in the second case I enter the minimum value first (22, 35, 38), and in the first case not the first (35, 38, 22..)


My code:

#include <iostream>

using namespace std;

typedef int Info;
struct Node
{
	Node* left,
		* right;
	Info info;
	char ch;
};

Node* CreateTree(int nodeCount);
void PrintTree(Node* root, int level);
Info InfixOrder(Node* root, Info& min, char& ch);

int main()
{
	char ch;
	int N, min = INT_MAX;
	cout << "Enter nodes count: "; cin >> N;
	Node* root = CreateTree(N);
	cout << endl;
	PrintTree(root, 0);
	cout << "Infix search: ";
	InfixOrder(root, min, ch);
	cout << endl << min << ch << endl;
	return 0;
}

Node* CreateTree(int nodeCount)
{
	if (nodeCount == 0)
		return NULL;
	else
	{
		Node* newNode = new Node;

		cout << " Enter node value: ";
		cin >> newNode->info;
		cout << " Enter node symbol: ";
		cin >> newNode->ch;

		int leftCount = nodeCount / 2;
		int rightCount = nodeCount - leftCount - 1;
		newNode->left = CreateTree(leftCount);
		newNode->right = CreateTree(rightCount);
		return newNode;
	}
}

void PrintTree(Node* root, int level)
{
	if (root != NULL)
	{
		PrintTree(root->right, level + 1);
		for (int i = 1; i <= level; i++)
			cout << "   ";
		cout << root->info;
		cout << root->ch << endl;
		PrintTree(root->left, level + 1);
	}
}

Info InfixOrder(Node* root, Info& min, char& ch)
{
	if (root != NULL)
	{
		InfixOrder(root->left, min, ch);
		cout << root->info << "";
		cout << root->ch << "   ";
		InfixOrder(root->right, min, ch);
		if (root->info < min) {
			min = root->info;
			ch = root->ch;
		}
	}
	return ch;
}