// C++PracticeApp.cpp : This file contains the 'main' function. Program execution begins and ends there. #include using namespace std; class Node { public: Node* next = NULL; int num; Node(int n) : num(n) {} void SetNext(Node* n) { next = n; } }; ///////////////////////// class IntBinTreeNode { public: IntBinTreeNode* LeftNode = NULL; IntBinTreeNode* RightNode = NULL; int num; IntBinTreeNode(int n) : num(n) {} void SetLeft(IntBinTreeNode* next) { LeftNode = next; } void SetRight(IntBinTreeNode* next) { RightNode = next; } }; void ShowTreeValues(IntBinTreeNode b) // The function checks all left nodes first , after finished, goes back and checks the right nodes { cout << b.num << endl; if (b.LeftNode != NULL) ShowTreeValues(*b.LeftNode); if (b.RightNode != NULL) ShowTreeValues(*b.RightNode); } //////////////////////////// int main() { //Normal Node Node* p; //Points to each node in the chain Node e(1); Node another(2); Node last(3); e.SetNext(&another); another.SetNext(&last); p = &e; // 1 --- > 2 --- > 3 --- > NULL cout << "Normal node : " << endl; while (p->next != NULL) // While there is a node connected to this node { cout << p->num << endl; p = p->next; } if (p != NULL) cout << p->num << endl; // last 1 cout << endl; //Binary tree of integers /* 1 2 3 4 5 6 */ //IntBinTreeNode first IntBinTreeNode first(1); IntBinTreeNode second(2); IntBinTreeNode third(3); IntBinTreeNode fourth(4); IntBinTreeNode fifth(5); IntBinTreeNode sixth(6); first.SetLeft(&second); first.SetRight(&third); second.SetLeft(&fourth); third.SetLeft(&fifth); third.SetRight(&sixth); cout << "All tree : " << endl; ShowTreeValues(first); cout << "\nLeft branch of tree : " << endl; ShowTreeValues(third); return 1; }

Binary Tree and linked lists