Tree Data Structure Simplified – Part 2
Outline Binary search trees BST Implementation Binary Heaps Trie Binary Search Tree A binary search tree is a binary tree with a unique feature – all nodes to the left of the current node must be smaller than the current node and all nodes to the right must be larger. This rule must be valid for all of the nodes in the tree, not just for the root