19. Binary Search Trees11 Questions
Created by Y. Daniel Liang
 http://www.cs.armstrong.edu/liang/index.html
Free

A __________ (with no duplicate elements) has 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.
The ________ of a path is the number of the edges in the path.
The _______ of a node is the length of the path from the root to the node.
The _______ of a nonempty tree is the length of the path from the root node to its furthest leaf + 1.
The ________ is to visit the left subtree of the current node first, then the current node itself, and finally the right subtree of the current node.
The _________ is to visit the left subtree of the current node first, then the right subtree of the current node, and finally the current node itself.
The _________ is to visit the current node first, then the left subtree of the current node, and finally the right subtree of the current node.
The _________ is to visit the nodes level by level. First visit the root, then all children of the root from left to right, then grandchildren of the root from left to right, and so on.
The time complexity for searching an element in a binary search tree is _______.
The time complexity for inserting an element into a binary search tree is _______.
The time complexity for deleting an element into a binary search tree is _______.