CSS Scroll Animation

Binary Search Tree is a Binary Tree in which the left sub-tree of a node has a value less than or equal to its parent node's value and the right sub-tree of a node has a value greater than or equal to its parent node's value.

Level-order traversal goes level by level in a binary tree.

Post-order traversal first visits the Left Subtree, then the Right Subtree and lastly, the Root.