2nd 10

Question 1

blank is made up of a finite set of nodes that is

either blank or consists of a node called the blank together with

two binary trees, called the left and right blank, which are disjoint from each other and from the root.

Answer 1

binary search tree
empty
root
subtrees

Question 2

each node is either a leaf or internal node with exactly two non-empty children.

If the height of the tree is d, then all leaves except possibly level d are completely full. The bottom level has all nodes to the left side.

Answer 2

Full binary tree:

Complete binary tree:

Question 2

A full binary tree with 1 internal node must have blank

Answer 2

two leaf nodes.

Question 3

what theorem states that The number of leaves in a non-empty blank tree is one more than the number of internal nodes.

Answer 3

full binary tree

Question 4

Any process for visiting the nodes in some order is called a blank

Answer 4

traversal.

Question 4

Any traversal that lists every node in the tree exactly once is called an blank of the tree’s nodes.

Answer 4

enumeration

Question 5

blank Visit each node before visiting its children.

blank Visit each node after visiting its children.

blank Visit the left subtree, then the node, then the right subtree.

Answer 5

Preorder traversal:

Postorder traversal:

Inorder traversal: