Question

What is observed in a binary tree data structure?

Answer 1

Explanation:

A Binary Search Tree is a finite set of nodes where each node stores a typed value known as the key for the node. A non-empty BST contains a special root node that is the ancestor of all other nodes in the BST.

Answer 2

Answer:

Many time we need to perform certain tasks on Binary trees. These tasks can be,

Counting nodes that satisfy some criteria.

Displaying all nodes in particular pattern like, printing expression from expression tree.

Creating mirror image of tree.

etc.