Question

An important application of binary tree is ______

(a) Huffman coding

(b) stack implementation

(c) queue implementation

(d) traverse a cyclic graph

The question was asked by my school principal while I was bunking the class.

I need to ask this question from Tree Traversal in section Trees of Discrete Mathematics

Answer 1

Right choice is (a) Huffman coding

Explanation: A binary tree is used to sort a list of elements; the inorder traversal will do this automatically. Better tree sorting algorithm will involve balancing the trees. The binary coding, in particular for the Huffman coding is an immediate application of binary trees.