Question-55
Data Structure
Tree
A binary search tree in which every node has either 0 or 2 children is referred as strictly binary tree. Such a tree with 21 leaves _________.
Answer
A binary search tree in which every node has either 0 or 2 children is referred as strictly binary tree. Such a tree with 21 leaves _________.