C++ 2-3- Trees: Create the 2-3 tree with 11 nodes (figure 1) by using class representation. Also, implement in-order traversal, and print the results.

struct Node

{

int small;

int large;

Node * left;

Node* middle;

Node* right;

}

SAMPLE:

Here's the inorder: 10 20 30 50 60 70 80 90 100 120 130 150 160

50 90 20 70 120 150 30 40 80) (100 110130 140 160 50 90 20 70 120 150 30 40 80) (100 110130 140 160