In postorder traversal of binary tree right subtree is traversed before visiting root.

Which of the following is/are correct about a strictly binary tree? A. A binary tree is called strictly binary tree if every non-leaf node of it has non empty left and right sub tree B. In strictly binary tree can have two children or no child C. A strictly binary tree with n leaves always contact 2n-1 nodes

A

Only A

B

Only B

C

A and B

D

A, B and C

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.

A

weight balanced and height balanced tree definations

B

height balanced and weight balanced tree definations

C

definations of weight balanced tree

D

definations of height balanced tree

The preorder traversal sequence of a binary search tree is 25, 15, 10, 4, 12, 22, 18, 24, 50, 35, 31, 44, 70, 66, 90 Which one of the following is the postorder traversal sequence of the same tree?

A

4, 12, 10, 18, 24, 15, 22, 31, 44, 50, 66, 90, 70, 35, 25

B

4, 12, 10, 18, 24, 22, 15, 31, 44, 35, 66, 90, 70, 50, 25

C

4, 10, 12, 15, 18, 22, 24, 25, 31, 35, 44, 50, 66, 70, 90

D

90, 70, 66, 50, 44, 35, 31, 25, 24, 22, 18, 15, 12, 10, 4

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree?

A

10, 20, 15, 23, 25, 35, 42, 39, 30

B

15, 10, 25, 23, 20, 42, 35, 39, 30

C

15, 20, 10, 23, 25, 42, 35, 39, 30

D

15, 10, 23, 25, 20, 35, 42, 39, 30

Postorder traversal of a given binary search tree T produces following sequence of keys: 3, 5, 7, 9, 4, 17, 16, 20, 18, 15, 14 Which one of the following sequences of keys can be the result of an in-order traversal of the tree T?

A

3, 4, 5, 7, 9, 14, 20, 18, 17, 16, 15

B

20, 18, 17, 16, 15, 14, 3, 4, 5, 7, 9

C

20, 18, 17, 16, 15, 14, 9, 7, 5, 4, 3

D

3, 4, 5, 7, 9, 14, 15, 16, 17, 18, 20

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 _________

A

A, C, D, B, E

B

A, B, C, D, E

C

A, B, C, E, D

D

D, B, E, A, C

Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode. typedef struct treeNode* treeptr; struct treeNode { treeptr leftMostChild, rightSibling; }; int DoSomething (treeptr tree) { int value=0; if (tree != NULL) { if (tree->leftMostChild == NULL) value = 1; else value = DoSomething(tree->leftMostChild); value = value + DoSomething(tree->rightSibling); } return(value); } When the pointer to the root of a tree is passed as the argument to DoSomething, the value returned by the function corresponds to the

A

number of internal nodes in the tree

B

height of the tree

C

number of nodes without a right sibling in the tree

D

number of leaf nodes in the tree

Consider the following Inorder and Preorder traversal of a tree Inorder – D B E F A G H C Preorder - A B D E F C G H What is the Postorder Traversal of the same tree

A

D F E B H C G A

B

D F E B G H C A

C

D F E B H G C A

D

D F E H B G C A

Consider the following statements. S1 : The sequence of procedure calls corresponds to a preorder traversal of the activation tree. S2 : The sequence of procedure returns corresponds to a postorder traversal of the activation tree. Which one of the following options is correct?

A

S₁ is true and S₂ is true

B

S₁ is false and S₂ is true

C

S₁ is false and S₂ is false

D

S₁ is true and S₂ is false

The steps for finding post-order traversal are traverse the right subtree, traverse the left subtree or visit the current node.

A

True

B

False

In postorder traversal of binary tree right subtree is traversed before visiting root.

Related Questions