easy5 pts · first answer countsgraphsbinary-search-tree

Inserting sorted keys into a plain BST

You insert order IDs 1, 2, 3, ..., 10000 in that order into a plain binary search tree with no balancing. What does the tree look like?

A.A chain where every node has only a right childB.A perfectly balanced tree of height about 13C.A tree where every node has two childrenD.A chain where every node has only a left child

Discussion 0

Join free to post in the discussion.

Inserting sorted keys into a plain BST

Discussion 0

Related questions