Java program to check if a binary tree is BST or not – A binary search tree (BST) is a node based binary tree data structure.
examples of trees
2 Articles
2
Efficient Huffman Coding for Sorted Input – Greedy Algorithm – Time complexity of the algorithm discussed in above post is O(nLogn). If we know that the given array is sorted (by non-decreasing order of frequency).