#include // no time to explain, get in the binary tree! template struct node { Type value; node *left; node *right; bool mark; }; template class tree { public: tree() { root = NULL; } ~tree() { destroy_tree(); root = NULL; } void destroy_tree() { destroy_tree(root); } void insert_value(int val) { if (root == NULL) { root = new node ; root->left = NULL; root->right = NULL; root->mark = false; root->value = val; } else insert_value(val, root); } void display_all_path() { display_all_path(root); } bool root_mark() { return root->mark; } private: node *root; void destroy_tree(node *leaf) { if (leaf != NULL) { destroy_tree(leaf->left); destroy_tree(leaf->right); delete leaf; leaf = NULL; } } void insert_value(int val, node *leaf) { if (val < leaf->value) { if (leaf->left == NULL) { leaf->left = new node ; leaf->left->value = val; leaf->left->mark = false; leaf->left->left = NULL; leaf->left->right = NULL; } else insert_value(val, leaf->left); } else { if (leaf->right == NULL) { leaf->right = new node ; leaf->right->value = val; leaf->right->mark = false; leaf->right->left = NULL; leaf->right->right = NULL; } else insert_value(val, leaf->right); } } void display_all_path(node *leaf) { if (leaf != NULL) std::cout << leaf->value << " "; if (leaf->left != NULL && !leaf->left->mark) display_all_path(leaf->left); else if (leaf->right != NULL && !leaf->right->mark) display_all_path(leaf->right); else leaf->mark = true; } }; int main() { tree obj; obj.insert_value(1); obj.insert_value(8); obj.insert_value(4); obj.insert_value(5); obj.insert_value(9); obj.insert_value(2); obj.insert_value(3); obj.insert_value(6); obj.insert_value(7); obj.insert_value(0); while (!obj.root_mark()) { obj.display_all_path(); std::cout << std::endl; } return 0; }

Binary Tree (All path)