Binary Search Trees (II)

Computer Science Level pending

Let \( min \) and \( max \) be the \( minimum \) and the \( maximum \) number of nodes in a BST (Binary Search Tree) of length (or height) 3 respectively. Find the value of \( min+max \)

Details and Assumptions:

  • \(Root\) \(node\) is considered to be at height ZERO.
×

Problem Loading...

Note Loading...

Set Loading...