In a binary search tree, which of the following traversals would print the numbers in the ascending order?

Related Questions

• Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
• The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?
• When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
• Which of the following pair’s traversals on a binary tree can build the tree uniquely?
• A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
• Which of the following graph traversals closely imitates level order traversal of a binary tree?
• The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
• The maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is
• An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by
• A binary tree of depth "d" is an almost complete binary tree if __________.