Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdafx.h"
- #include <iostream>
- using namespace std;
- struct tnode {
- int field;
- struct tnode *left;
- struct tnode *right;
- };
- void traversalShow(tnode *tree) {
- if (tree != NULL) {
- cout << "Корень: ";
- cout << tree->field<<endl;
- if (tree->left != NULL) cout << "Левое поддерево для корня "<< tree->field << endl;
- traversalShow(tree->left);
- if (tree->right != NULL) cout << "Правое поддерево для корня " << tree->field << endl;
- traversalShow(tree->right);
- }
- }
- void treeprint(tnode *tree) {
- if (tree != NULL) {
- if (!(((tree->left != NULL) && (tree->right!=NULL))||((tree->left == NULL) && (tree->right == NULL))))
- cout << "Корень: " << tree->field << endl;
- treeprint(tree->left);
- treeprint(tree->right);
- }
- }
- struct tnode* addnode(int x, tnode *tree) {
- if (tree == NULL) {
- tree = new tnode;
- tree->field = x;
- tree->left = NULL;
- tree->right = NULL;
- }
- else if (x < tree->field)
- tree->left = addnode(x, tree->left);
- else
- tree->right = addnode(x, tree->right);
- return(tree);
- }
- int main()
- {
- setlocale(LC_ALL, "ru");
- tnode *tree = NULL;
- tree = addnode(5, tree);
- tree = addnode(7, tree);
- tree = addnode(3, tree);
- tree = addnode(6, tree);
- tree = addnode(4, tree);
- tree = addnode(2, tree);
- tree = addnode(1, tree);
- tree = addnode(8, tree);
- tree = addnode(9, tree);
- traversalShow(tree);
- cout << endl;
- treeprint(tree);
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment