2 votes 2 votes In binary search tree which traversal is used for getting ascending order values ? Inorder Preorder Postorder None of the options DS nielit2017dec-assistanta data-structures binary-search-tree tree-traversal + – admin asked Mar 31, 2020 recategorized Aug 24, 2020 by Lakshman Bhaiya admin 939 views answer comment Share Follow See 1 comment See all 1 1 comment reply Hradesh patel commented Mar 31, 2020 reply Follow Share Inorder gives ascending order Option A is correct 2 votes 2 votes Please log in or register to add a comment.
2 votes 2 votes For Binary Search Tree, Inorder gives keys in ascending order. So A is correct. smsubham answered Mar 31, 2020 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes When Binary Search Tree are Traverse Inorder Then it will Give Increasing order of Value So Inorder Could be A Answer Himanshu Kumar Gupta answered Sep 20, 2020 Himanshu Kumar Gupta comment Share Follow See all 0 reply Please log in or register to add a comment.