Please with question in image in C++ language. Thanks **2-3 Trees: Create the 2-3 tree with 11 nodes. Also, implement in-order traversal, and findItem functions.**```cstruct Node { int small; int large; Node *left; Node *middle; Node *right;}void inOrder(Node *tree);Node *findItem(Node *tree, int target);```The diagram illustrates a 2-3 tree with the following structure:- The root node contains values 50 and 90. - The left child of the root contains values 20, with further children containing values 10, and 30/40. - The middle child of the root contains values 70, with a child containing value 60. - The right child of the root contains values 120 and 150, with further children containing values 100, 110, 130/140, and 160.**Sample Run:**A screenshot shows the console with the following output:```Part 1: in-order traversal10 20 30 40 50 60 70 80 90 100 110 120 130 140 150 160Part 2: find itemSearch 50Item was found.Search 100Item was found.```This code implements an in-order traversal that processes nodes in increasing order. The findItem function is used to search for specific values, confirming their presence in the tree.

Trees: Create the 2-3 tree with 11 nodes. Also, implement in-order traversal, and findltem functions. struct Node int small; int large; Node * left; Node* middle; Node* right; void inorder (Node tree) ; Node *findItem (Node *tree, int target); 50 90 70 (120 150 (10) 30 40 60 (80 (100 110) (130 140) (160) Sample Run: CAUsers\elee\Desktop\CPSC250-Test\Debug\CPSC250-Test.exe Part 1: in-order traversal 10 20 30 40 50 60 70 80 90 100 110 120 130 140 15o 160 Part 2: find item Search 50 Item was found. Search 100 Item was found.

Trees: Create the 2-3 tree with 11 nodes. Also, implement in-order traversal, and findltem functions. struct Node int small; int large; Node * left; Node* middle; Node* right; void inorder (Node tree) ; Node findItem (Node tree, int target); 50 90 70 (120 150 (10) 30 40 60 (80 (100 110) (130 140) (160) Sample Run: CAUsers\elee\Desktop\CPSC250-Test\Debug\CPSC250-Test.exe Part 1: in-order traversal 10 20 30 40 50 60 70 80 90 100 110 120 130 140 15o 160 Part 2: find item Search 50 Item was found. Search 100 Item was found.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Explain the concept and importance of interface in object oriented programming
Recall the topic USING ARRAYS and answer the questions below 1. What is the purpose of the ‘new’ operator in C#?
What is the difference between deploying and publishing an application while working in C#?
What would you expect to be the level of use of pointers in C#? How often will they be used when it is not absolutely necessary?
solve in c#
What is the primary contrast between non-static, static, read-only, and constant variables in the C# programming language?