DSA - QA3

Identify the last node in the post-order traversal of this binary tree.

• 8

• 1

• 9

• 5

Identify the statement which is wrong about binary trees

• Any node can have a maximum of two children

• The degree of a node can be 0

• The degree of any node can exceed 2

• It can be a skewed tree

The minimum number of nodes in a tree with height m is _____

• 2*m

• m-1

• m

• m+1

If we use sequential representation of binary tree, a node at position i will have its left child at ______________

• i/2

• i+1

• 2*i

• 2*i*2

If we want to generate the elements in ascending order from a BST, we need to use _______________ traversal.

• in-order

• pre-order

• post-order

• level order

In a binary tree data structure, any node can have a maximum of 2 parent nodes.

• True

• False

If the root of a BST has 16 as the key, then the key element 31 should be inserted in the _____________

• right sub-tree of root

• left sub-tree of root

• either left sub-tree of right sub-tree of the root

A max-heap is a complete binary tree.

• False

• True

The MAX-HEAPIFY function will swap the parent node with the ________ child node on a mismatch.

• larger

• smaller

• left

• right

The running time of MAX-HEAPIFY function is

• O(n)

• O{n^2)

• O(logn)

• O(nlogn)