مرضیه ناصریФотография
struct Node { int val; Node* left; Node* right; Node(int v) : val(v), left(nullptr), right(nullptr) {} }; void inorder(Node* root) { if (root == nullptr) return; inorder(root->left); system.out.println(" root->val ") ; inorder(root->right); } public static void int main( string[] args) { Node* root = new Node(1); root->left = new Node(2); root->right = new Node(3); root->left->left = new Node(4); root->left->right = new Node(5); root->right->left = new Node(6); root->right->right = new Node(7); system. out. println(" Original Tree (inorder traversal): "); inorder(root); system.out.println(" endl"); // Perform convertion to sibling and child tree return 0; }