Word Matching Exercise

Section 21.2 Word Matching Exercise

Binary Tree

Binary Search Tree

Length

Depth

Level

Leaf

Height

Sibling

Root

	is the length of the path from the root to the node.
	of a node is the node with the same parent.
	is a node without children.
	is the starting node of the tree.
	is a hierarchical structure. It either is empty or consists of an element, called the root, and two distinct binary trees, called the left subtree and right subtree, either or both of which may be empty.
	is the number of the edges in the path.
	is a binary search tree with the property that for every node in the tree, the value of any node in its left subtree is less than the value of the node, and the value of any node in its right subtree is greater than the value of the node.
	is the set of all nodes with the same depth.
	of a nonempty tree is the length of the path from the root node to its furthest leaf. It is 0 if the tree contains a single node. Conventionally, it is -1 for an empty tree.