Home Library Explore SAT

Home Library Explore SAT

o10 🧩 Expression Trees and Notations 🧮 Flashcards | StudBud

Explore/o10 🧩 Expression Trees and Notations 🧮

o10 🧩 Expression Trees and Notations 🧮

8 terms·StudBud Administration·52 plays

Expression trees 🌳 are binary trees where internal nodes are operators ➕➗ and leaf nodes are operands 🔢. These trees allow evaluation of complex expressions using prefix, infix, and postfix notations. This exam challenges your ability to interpret, traverse, and evaluate expression trees just like a real calculator! 🧠🧑‍💻

Flashcards8 cardsFPractice quizPHost liveL

Questions 8

Answers

1
📦 In postfix notation, when is the root processed?
🧠 Before all nodes
🌀 After both subtrees
🌱 In the middle of traversal
📚 It is not visited
2
📌 In expression trees, what do leaf nodes represent?
📐 Control structures
🎯 Operators like +, *
🧮 Operands like numbers or variables
🧩 Conditional logic
3
🔄 What does an expression tree evaluate?
📦 Logical conditions
🧠 Mathematical operations
💬 Text formatting
🪄 Sorting operations
4
🌳 What is an expression tree?
🔢 A tree storing array indices
📦 A tree of only string values
➕ A binary tree with operators and operands
🪵 A structure with no parent-child link
5
🧰 Which notation places the root last?
🔁 Postfix
🧱 Midfix
📚 Infix
🧮 Prefix
6
📐 In infix (indorder) notation, what is the correct order?
📘 Right → Left → Root
🧩 Left → Root → Right
🔁 Root → Subtree → Subtree
🧠 Root → Right → Left
7
🧭 What is the order of prefix notation?
🔄 Right → Root → Left
📚 Left → Root → Right
📉 Node → Sibling → Parent
🧠 Root → Left → Right
8
🧮 What makes expression trees binary?
🔀 All nodes are strings
🧬 They store decimal values
🧱 Every node has two siblings
📏 Every node has two children or none