The number of edges from the root to the node is called……… of the tree.
a) Height
b) Depth
c) Length
d) Width
Explanation: The number of edges from the root to the node is called depth of the tree.
The number of edges from the node to the deepest leaf is called……. of the tree.
a) Height
b) Depth
c) Length
d) Width
Explanation: The number of edges from the node to the deepest leaf is called height of the tree.
What is a full binary tree?
a) Each node has exactly zero or two children
b) Each node has exactly two children
c) All the leaves are at the same level
d) Each node has exactly one or two children
Explanation: A full binary tree is a tree in which each node has exactly 0 or 2 children.
What is a complete binary tree?
a) Each node has exactly zero or two children
b) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left
c) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right
d) A tree In which all nodes have degree 2
What is the average case time complexity for finding the height of the binary tree?
a) h = O(loglogn)
b) h = O(nlogn)
c) h = O(n)
d) h = O(log n)
Which of the following is not an advantage of trees?
a) Hierarchical structure
b) Faster search
c) Router algorithms
d) Undo/Redo operations in a notepad
Explanation: Undo/Redo operations in a notepad is an application of stack. Hierarchical structure, Faster search, Router algorithms are advantages of trees.
