If we were to print the following tree using pre-order traversal, what would you expect the output to be? .-------(098)-------. .--(012)--. .--(402)-------.(010) (054) (045) .--(128)--. (092) (065)10, 54, 12, 45, 92, 65, 128, 402, 9810, 12, 54, 98, 45, 402, 92, 128, 6598, 12, 402, 10, 54, 45, 128, 92, 6598, 12, 10, 54, 402, 45, 128 ,92, 65

Say that we have a binary search tree with the keys 1, 2, 3, 4, 5, 6, 7. A preorder traversal of the tree prints the keys in the sequence 4, 1, 3, 2, 6, 5, 7. What sequence would be printed by a postorder traversal of the tree?

What is in-order traversal?left subtree is visited first, then the right subtree and finally the root nodethe root node is visited first, then the left subtree and finally the right subtreethe left subtree is visited first, then the root and later the right sub-tree

VERTICAL ORDER TRAVERSALYou are given root of a binary tree, your task is to print the nodes in order obtained via vertical traversal of the tree.The vertical order traversal of a binary tree is a list of top-to-bottom orderings for each column index starting from the leftmost column and ending on the rightmost column. There may be multiple nodes in the same row and same column. In such a case, sort these nodes by their values.For each node at position (row, col), its left and right children will be at positions (row + 1, col - 1) and (row + 1, col + 1) respectively. The root of the tree is at (0, 0).Input format :The first line contains the number of test cases.For each test case: You are given a pointer to the root of the binary tree.Output format :Print the nodes in order obtained via vertical traversal of the tree. Refer the same Input/Output provided.Sample test cases :Input 1 :11 2 3Output 1 :2 1 3 Note :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.

Given the sequence of integers: '90, 71, 110, 103, 111, 69, 83, 70, 81, 84, 51, 104, 99', draw a BST and the select the correct sequence of the Pre-order traversal after adding a new node with the value '99' to the BST. (You may need to draw a tree to solve this) Question 28Select one: 111, 104, 99, 103, 110, 84, 83, 81, 71, 70, 69, 51, 90 90, 71, 69, 70, 51, 83, 81, 84, 110, 103, 99, 111, 014 90, 51, 111, 104, 99, 103, 110, 84, 83, 81, 71, 70, 69 90, 71, 69, 51, 70, 83, 81, 84, 110, 103, 99, 104, 111

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?