Question

Is a directed tree in which outdegree of each node is less than or equal to two?

Answer 1

Binary Search Tree (also called BST) is a directed tree in which out degree of each node is less than or equal to two.

A tree is a non-linear data structure in which each element has one parent element and may have any number of children elements which further may have any number of children elements.

A directed tree is a tree having specific relations between it's elements.

For instance, in a Binary Search tree, the left child of an element is always smaller than it and the right child of the element it always greater than it.