Which traversal method is used to get the elements of a BST in non-decreasing order?

Which of these traversals will output elements in sorted manner in a BST? Answer choicesSelect only one optionREVISITPre-order TraversalPost-order TraversalIn-order TraversalNone of these

Which of the following traversal methods can be used to obtain a sorted sequence of elements in a binary search tree?

Find preorder traversal of height balanced BSTGiven a sorted array. Convert it into a Height balanced Binary Search Tree (BST). Find the preorder traversal of height balanced BST. If there exist many such balanced BST consider the tree whose preorder is lexicographically smallest.Height balanced BST means a binary tree in which the depth of the left subtree and the right subtree of every node never differ by more than 1.Sample input25 1 4 5 7 8 12 14 15 19 20 22 25 26 27 28 29 33 34 37 40 41 42 43 47 48Sample outputoutput=26 12 5 1 4 7 8 19 14 15 22 20 25 37 2

Which type of traversal of binary search tree outputs the value in sorted order ?a) Pre-orderb) In-orderc) Post-orderd) None

void printLevel(struct Node* root, int level) { // Function to print nodes at a specific level of a BST}void printLevelOrder(struct Node* root) { // Function to print the level order traversal of a BST}