BinaryTree Traversal , More on BinaryTree & Threaded Binary

What is the sequence ordering of Inorder?

• RDL

• LDR

• LRD

• DLR

The output expression of the preorder traversal in binary tree is _______

• Infix expression

• Postfix Expression

• Prefix Expression

• none

Which of the following tree traversal visit root node first?

• Inorder

• Post order

• Preorder

• All

Binary trees are __________ if they have the same topology and the information in corresponding nodes is identical.

• sequence

• equivalent

• differs

• combine

RCHILD(P) is normally equal to zero, can replace it by a pointer to the node which would be printed after P when traversing the tree in inorder.

• True

• False

A null LCHILD link at node P is replaced by a pointer to the node which immediately precedes node P in inorder.

• True

• False

If LCHILD(P) is a normal pointer when LBIT(P) =1

• True

• False

How many fields are there in each node of a threaded binary tree?

• 7

• 4

• 5

• 3