Given the root of a binary tree, invert the tree, and return its root. Example 1:Input: root = [4,2,7,1,3,6,9]Output: [4,7,2,9,6,3,1]

Invert the Binary TreeGiven the root of a binary tree, invert the tree, and return its root. Print the Inorder traversal of the inverted tree.Input format:The input consists of one line, space-separated elements denoting the nodes of the Binary Tree.Output format:Print the inorder traversal of the inverted tree in a single line.

Given the root of a binary tree, return the leftmost value in the last row of the tree. Example 1:Input: root = [2,1,3]Output: 1

Given the root of a binary tree, return the preorder traversal of its nodes' values. Example 1:Input: root = [1,null,2,3]Output: [1,2,3]Example 2:Input: root = []Output: []Example 3:Input: root = [1]Output: [1] Constraints:The number of nodes in the tree is in the range [0, 100].-100 <= Node.val <= 100 Follow up: Recursive solution is trivial, could you do it iteratively?

Given the root of a perfect binary tree, reverse the node values at each odd level of the tree.For example, suppose the node values at level 3 are [2,1,3,4,7,11,29,18], then it should become [18,29,11,7,4,3,1,2].Return the root of the reversed tree.A binary tree is perfect if all parent nodes have two children and all leaves are on the same level.The level of a node is the number of edges along the path between it and the root node. Example 1:Input: root = [2,3,5,8,13,21,34]Output: [2,5,3,8,13,21,34]Explanation: The tree has only one odd level.The nodes at level 1 are 3, 5 respectively, which are reversed and become 5, 3.

Consider the below codetakeInput() print("Enter root data") rootData = int(input()) if (rootData == -1) return None root = BinaryTreeNode(rootData) root.left = takeInput() root.right = takeInput() return rootWhat will be the input(excluding -1) to above code to construct this tree ? 1) 2 7 2 6 5 11 5 9 4 2) 2 7 5 6 11 2 5 4 9 3) 2 7 5 2 6 9 5 11 4