A binary search tree becomes degenerate (skewed) when elements are inserted in:

Which traversal of a binary search tree visits nodes in ascending sorted order?

Which traversal visits the root node last, after both subtrees?

The height of a binary tree with a single node (the root) is:

What is the worst-case time complexity of searching for an element in a balanced binary search tree with n nodes?

The number of edges in a tree with n nodes is always:

A complete binary tree of height h contains at most how many nodes?