Applications of BST Binary Search Tree, is a node-based binary tree data structure which has the following properties: The left subtree of a node contains only nodes with keys lesser than the node’s key. Applications of Binary Tree What is a Binary Tree? The right subtree of a node contains only nodes with keys greater than the node’s key. Binary Tree with Introduction, Asymptotic Analysis, Array, Pointer, Structure, Singly Linked List, Doubly Linked List, Circular Linked List, Binary Search, Linear Search, Sorting, Bucket Sort, Comb Sort, Shell Sort, Heap Sort, Merge Sort, Selection Sort, Counting Sort, Stack, Qene, Circular Quene, Graph, Tree, B Tree, B+ Tree, Avl Tree etc. A Tree is a non-linear data structure where data objects are generally organized in terms of hierarchical relationship. Practical applications of a tree Trees can be used to store data that has an inherent hierarchical structure. The structure is non-linear in the sense that, unlike Arrays, Linked Lists, Stack and Queues, data in a tree is not organized linearly. For example, an operating system may use a tree for directories, files and folders in its file management system. Other Applications : Store hierarchical data, like folder structure, organization structure, XML/HTML data. Each node must contain data that can be easily compared, such as integers. A binary tree is a data structure that consists of nodes that each have up to 2 children. Binary Search Tree is a tree that allows fast search, insert, delete on a sorted data.