Computer Science

# Trees - Intermediate

How many distinct binary search trees can be created out of $$4$$ distinct trees?

Which of the following is true about Binary trees?

Details and Assumptions

A full binary tree is a tree in which every node other than the leaves has two children.

A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.

Consider a complete binary tree where the left and the right subtrees of the root are max-heaps. What is the lower bound for the number of operations to convert the tree to a heap?

×