Trees

Enter your Rollno

In a general tree, a node can have at most

• 1 child

• 2 children

• Any number of children

• No children

The depth of a node in a tree is:

• Number of leaves in the tree

• Number of nodes in the path from root to the node

• Number of edges from the node to the deepest leaf

• Always equal to height of the tree

A tree with ‘n’ nodes has exactly how many edges?

• n

• n – 1

• n + 1

• 2n

A full binary tree is a tree in which:

• Every node has 0 or 1 child

• Every level must be completly filled

• Every node has 0 or 2 children

• All leaves are at the same level

The maximum number of nodes in a binary tree of height h (with root at level 1) is:

• 2^h

• 2^h – 1

• 2^(h+1)

• h^2

Which traversal method is used in expression trees to get the prefix expression?

• Preorder

• Postorder

• Inorder

• Level Order

A complete binary tree is:

• All levels are fully filled

• All levels except possibly the last are full, and the last level is filled from left to right

• All nodes have two children

• A tree with only left children

In a Binary Search Tree (BST), the left subtree contains:

• Only smaller values than the root

• Only larger values than the root

• Both smaller and larger values

• Duplicate values

The root of a tree is:

• A leaf node

• node with only one child

• The topmost node of the tree

• The deepest node in the tree