adplus-dvertising
frame-decoration

Question

Traversing a binary tree first root and then left and right subtrees called _______traversal.

a.

inorder

b.

preorder

c.

postorder

d.

none of these

Answer: (b).preorder

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Traversing a binary tree first root and then left and right subtrees called _______traversal.

Similar Questions

Discover Related MCQs

Q. A binary tree having n nodes and depth d will be about complete binary tree if

Q. Which of the following statements is/are correct ?

Q. A binary tree of depth "d" is an almost complete binary tree if

Q. If each node in a tree has value greater the every value in its left subtree and has value less than every value in its right subtree, the tree is called

Q. The number of nodes in a complete binary tree of level 5 is

Q. The smallest number of key that will force a B-tree of order 3 to have a height 3 is

Q. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves

Q. Number of possible binary trees with 3 nodes is

Q. A-2-3 tree is a tree such that 1. All internal nodes have either 2 or 3 children. 2. All paths from root to the leaves have the same length. The number of internal nodes of a 2-3 tree having 9 leaves could be

Q. A binary tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20,58, 91, 3,8,37, 60, 24 The number of nodes in the left of the root respectively is

Q. Consider the following nested representation of binary trees indicates y and z are the left right subtrees, respectively, of node x. Note that y and z may be NULL or further nested. Which of the following represents a valid binary tree?

Q. B+- trees are preferred to binary trees in databases because

Q. A full binary tree with n non-leaf nodes contains

Q. The depth of a complete binary tree with 'n nodes is (log is to be base two)

Q. Which of the below diagram is following AVL tree property?

Q. Is the below tree representation of 50,100,400,300,280 correct way to represent cartesian tree?

Q. What is the condition for a tree to be weight balanced. where a is factor and n is a node?

Q. What are the operations that can be performed on weight balanced tree?

Q. Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as

Q. What does the below definations convey?

i. A binary tree is balanced if for every node it is gonna hold that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1.
ii. A binary tree is balanced if for any two leaves the difference of the depth is at most 1.