Trees

The number of edges from the root to the node is called __________ of the tree.

• Height

• Depth

• Length

• Path

Which of the following is not an application of trees?

• Game playing

• Database indexing

• Router algorithms

• Undo/Redo operations in a notepad

A full binary tree with n leaves contains

• n nodes

• 2n - 1 nodes

• 2n + 1 nodes

• n+1 nodes

A tree with N nodes has _______ null pointers.

• N+1

• N-1

• N

• 2N

A tree with N nodes has ____________ edges.

• N+1

• N-1

• 2N+1

• 2N-1

The leftmost node in a Binary Search Tree contains the (a)   value among all the nodes.

Which tree traversal resembles the graph's breadth-first search?

• Preorder

• Postorder

• levelorder

• inorder

A tree in which all leaves are at the same and each node has 0 or 2 children is called ___________.

• Full binary tree

• Complete binary tree

• Binary search tree

• Heap

Tree is used to represent (a)   type of relationships.

Average Time complexity of operations on a tree is O(________).

• N

• log N

• N^2

• N^3