عمليات المكدس (Stack Operations) - كتاب الذكاء الإصطناعي - الصف 12 - الفصل 1 - المملكة العربية السعودية

نفذ البرنامج السابق كما يلي:• أنشئ مكدسًا من ثلاثة أرقام. • أضف العناصر إلى المكدس.The stack so far is: [] --------------------------------- Choose 1 for push Choose 2 for pop Choose 3 for end --------------------------------- Enter your choice: 1 Enter element for push: 26 The stack so far is: [26] --------------------------------- Choose 1 for push Choose 2 for pop Choose 3 for end --------------------------------- Enter your choice: 1 Enter element for push: 18 The stack so far is: [26, 18] --------------------------------- Choose 1 for push Choose 2 for pop Choose 3 for end --------------------------------- Enter your choice: 1 Enter element for push: 23 The stack so far is: [26, 18, 23]--- SECTION: شكل 1.20: إضافة العناصر --- شكل 1.20: إضافة العناصر يمكنك الآن حذف عنصرين من المكدس، ثم الخروج من البرنامج.Choose 1 for push Choose 2 for pop Choose 3 for end --------------------------------- Enter your choice: 2 The pop element is: 23 The stack so far is: [26, 18] --------------------------------- Choose 1 for push Choose 2 for pop Choose 3 for end --------------------------------- Enter your choice: 2 The pop element is: 18 The stack so far is: [26] --------------------------------- Choose 1 for push Choose 2 for pop Choose 3 for end --------------------------------- Enter your choice: 3 End of program--- SECTION: شكل 1.21: حذف العناصر --- شكل 1.21: حذف العناصر2023 - 1447--- VISUAL CONTEXT --- **DIAGRAM**: شكل 1.20: إضافة العناصر Description: A series of three diagrams illustrating the 'push' operation on a stack. Each diagram shows the stack growing by one element. The first shows an empty stack, then element 26 is pushed. The second shows 26 at the bottom, and 18 is pushed on top. The third shows 26, 18, and 23 is pushed on top. Arrows indicate the direction of adding elements. Labels 'أضف العنصر إلى المكدس' (Add element to stack) are present above the arrows. Data: The stack starts empty. Element 26 is added, then 18, then 23. The elements are stacked on top of each other, with the most recently added element at the top. Key Values: 26, 18, 23 Context: Illustrates the Last-In, First-Out (LIFO) principle of a stack data structure during the push operation, showing how elements are added sequentially to the top.**DIAGRAM**: شكل 1.21: حذف العناصر Description: A series of three diagrams illustrating the 'pop' operation on a stack. Each diagram shows the stack shrinking by one element. The first shows a stack with elements 26, 18, 23 (from bottom to top), and element 23 is popped. The second shows 26, 18, and 18 is popped. The third shows only 26 remaining. Arrows indicate the direction of removing elements. Labels 'حذف العنصر من المكدس' (Remove element from stack) are present above the arrows. Data: The stack starts with elements [26, 18, 23]. Element 23 is removed (popped) from the top, leaving [26, 18]. Then element 18 is popped, leaving [26]. The elements are removed from the top of the stack. Key Values: 26, 18, 23 Context: Illustrates the Last-In, First-Out (LIFO) principle of a stack data structure during the pop operation, showing how elements are removed sequentially from the top.