CSD203_q6_tree1

A tree is a nonlinear hierarchical data structure that consists of _____ connected by edges.

• nodes

• elements

• attributes

• root

The height of a node is the number of _____ from the node to the deepest leaf (ie. the longest path from the node to a leaf node).

The depth of a node is the number of _____ from the root to the node.

• edges

• nodes

• leafs

• internal node

• external nodes

• h is the height of a node, d is the depth of a node. Fill in the _

• h = 0

  d = 1

• h = 1

  d = 0

• h = 0

  d = 0

• h = 1

  d = 1

A collection of disjoint _____ is called a forest.

The code traverses the tree in what order?

• inorder

• postorder

• preorder

• levelorder

The code traverses the tree in ________ order.

The code traverses the tree in ________ order.

A full Binary tree is a special type of binary tree in which every parent node/internal node has either ___ or no children.

A perfect binary tree is a type of binary tree in which every internal node has exactly two child nodes and all the leaf nodes are at the ____ level.