[Solved] Draw Expression Tree Following Expressions Given Prefix Postfix Infix 2 34 2 5 32 4 6 B Q37295993

please explain each line of code

please ignore first photo!

Draw the expression tree for the following expressions (given in prefix, postfix, or infix) 2. a. 34-2+5 a. (32) (4/6) b. 992 Draw the following Binary Tree structure after executing the following code: 3. a LinkedBinaryTree.Node (5) b LinkedBinaryTree.Node 14) c LinkedBinaryTree.Node (6, a,b) d LinkedBinaryTree. Node (8) e -LinkedBinaryTree. Node (10, None, d) E-LinkedBinaryTree.Node (12, e, ) bin tree-LinkedBinaryTree (E) Write a function that will invert a LinkedBinaryTree in-place (no new nodes are created. You are simply changing the left and right references.) 3. You will write two implementations, one recursive, and one non recursive Both functions will be given a parameter, root, which is the root node of the binary tree. You may not call any methods from the LinkedBinaryTree class. Specifically, you should traverse the tree in your function. def invert binary treel (root) Inverts the binary tree using recursion def invert binary tree2 (root) ..” Inverte the binasy tree vithout recursion .. Hint: For the non recursive implementation, you may want to use the breadth-first generator ex) will become 6 6 4. A full binary tree (or proper binary tree) is a binary tree in which every node in the tree has 2 or 0 children. Implement the following function, which takes in the root node of a LinkedBinaryTree and determines whether or not is is a full tree. Ihis function should be recursive You may not call any methods from the LinkedBinaryTree class. Specifically, you should traverse the tree in your function ǐs def full(root); – Returns True if the Binary Tree is ful1 and false if not ex) 5. A complete binary tree is a binary tree in which every level of the tree contains all possible nodes. Implement the following function, which takes in the root node of a LinkedBinaryTree and determines whether or not is is a full tree. This function should be iterative. You may not call any methods from the LinkedBinaryTree class. Specifically, you should traverse the tree in your function. def is complete (root): Returns True if the Binary Tree is complete and false if not Hint: For the non recursive implementation, you should use the breadth-first search with an ArrayQueue ex) 10) 13 14) 5127)815 1 4 6. Add the following method to the LinkedBinaryTree class. def preorder with stack Returns a generator function that iterates through the tree using the preorder traversal”’ The method is a generator function that when called, will iterate through the binary tree using preorder traversal without recursion. You will use one ArrayStack and Θ(1) extra space. Preorder is as followed: Data, Left, Right. When you’re tracing the preorder traversal of the binary tree, imagine how you would place the nodes in the stack, and when you would pop the nodes from the stack. Think of recursion and the call stack! ex) Given the following code using the tree example below: t is a LinkedBinaryTree for item in t.preorder with stack): print() You should expect the following output 2 7 2 6 5 11 5 9 4 print(item, end 2 6 11) 4 1. Write a recursive function that returns the sum of all even integers in a LinkedBinaryTree. Your function should take one parameter, root node. You may assume that the tree only contains integers. You may not call any methods from the LinkedBinaryTree class. Specifically, you should traverse the tree in your function def binary tree even sum (root): Returns the sum of al1 even integers in the binary tree 2. Write a recursive function that determines whether or not a value exists in a LinkedBinaryTree. Your function should take two parameters, a root node and a val, and return True if val exists or False if not. You may not call any methods from the LinkedBinaryTree class. Specifically, you should traverse the tree in your function. def binary tree contains froot, val) Returns True if val exists in the binary tree and false if not” Show transcribed image text Draw the expression tree for the following expressions (given in prefix, postfix, or infix) 2. a. 34-2+5 a. (32) (4/6) b. 992 Draw the following Binary Tree structure after executing the following code: 3. a LinkedBinaryTree.Node (5) b LinkedBinaryTree.Node 14) c LinkedBinaryTree.Node (6, a,b) d LinkedBinaryTree. Node (8) e -LinkedBinaryTree. Node (10, None, d) E-LinkedBinaryTree.Node (12, e, ) bin tree-LinkedBinaryTree (E)
Write a function that will invert a LinkedBinaryTree in-place (no new nodes are created. You are simply changing the left and right references.) 3. You will write two implementations, one recursive, and one non recursive Both functions will be given a parameter, root, which is the root node of the binary tree. You may not call any methods from the LinkedBinaryTree class. Specifically, you should traverse the tree in your function. def invert binary treel (root) Inverts the binary tree using recursion def invert binary tree2 (root) ..” Inverte the binasy tree vithout recursion .. Hint: For the non recursive implementation, you may want to use the breadth-first generator ex) will become 6 6
4. A full binary tree (or proper binary tree) is a binary tree in which every node in the tree has 2 or 0 children. Implement the following function, which takes in the root node of a LinkedBinaryTree and determines whether or not is is a full tree. Ihis function should be recursive You may not call any methods from the LinkedBinaryTree class. Specifically, you should traverse the tree in your function ǐs def full(root); – Returns True if the Binary Tree is ful1 and false if not ex)
5. A complete binary tree is a binary tree in which every level of the tree contains all possible nodes. Implement the following function, which takes in the root node of a LinkedBinaryTree and determines whether or not is is a full tree. This function should be iterative. You may not call any methods from the LinkedBinaryTree class. Specifically, you should traverse the tree in your function. def is complete (root): Returns True if the Binary Tree is complete and false if not Hint: For the non recursive implementation, you should use the breadth-first search with an ArrayQueue ex) 10) 13 14) 5127)815 1 4
6. Add the following method to the LinkedBinaryTree class. def preorder with stack Returns a generator function that iterates through the tree using the preorder traversal”’ The method is a generator function that when called, will iterate through the binary tree using preorder traversal without recursion. You will use one ArrayStack and Θ(1) extra space. Preorder is as followed: Data, Left, Right. When you’re tracing the preorder traversal of the binary tree, imagine how you would place the nodes in the stack, and when you would pop the nodes from the stack. Think of recursion and the call stack! ex) Given the following code using the tree example below: t is a LinkedBinaryTree for item in t.preorder with stack): print() You should expect the following output 2 7 2 6 5 11 5 9 4 print(item, end 2 6 11) 4
1. Write a recursive function that returns the sum of all even integers in a LinkedBinaryTree. Your function should take one parameter, root node. You may assume that the tree only contains integers. You may not call any methods from the LinkedBinaryTree class. Specifically, you should traverse the tree in your function def binary tree even sum (root): Returns the sum of al1 even integers in the binary tree 2. Write a recursive function that determines whether or not a value exists in a LinkedBinaryTree. Your function should take two parameters, a root node and a val, and return True if val exists or False if not. You may not call any methods from the LinkedBinaryTree class. Specifically, you should traverse the tree in your function. def binary tree contains froot, val) Returns True if val exists in the binary tree and false if not”

Expert Answer

---

Answer to Draw the expression tree for the following expressions (given in prefix, postfix, or infix) 2. a. 34-2+5 a. (32) (4/6) b… . . .