Binary Tree Quiz

What is the maximum number of children that a binary tree node can have?

• 0

• 1

• 2

• 3

The following given tree is an example for?

• Binary tree

• Binary search tree

• Fibonacci tree

• none

How many common operations are performed in a binary tree?

• 1

• 2

• 3

• 4

What is the traversal strategy used in the binary tree?

• depth-first traversal

• breadth-first traversal

• random traversal

• Priority traversal

How many types of insertion are performed in a binary tree?

• 1

• 2

• 3

• 4

What operation does the following diagram depict?

• inserting a leaf node

• inserting an internal node

• deleting a node with 0 or 1 child

• none

How many bits would a succinct binary tree occupy?

• n+O(n)

• 2n+O(n)

• n/2

• n

The average depth of a binary tree is given as?

• O(N)

• O(√N)

• O(N2)

• O(log N)

How many orders of traversal are applicable to a binary tree (In General)? 3

• 1

• 4

• 2

• 3

If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?

• 2i+1

• 2i+2

• 2i

• 4i