Educator

Trees

• A tree is a data structure where data is stored in the children nodes.

• A binary tree is a tree that has at most 2 children and each sub-tree is a binary tree by itself.

• A binary Search Tree(BST) is a binary tree in which the value stored in each node on the left must be smaller than the parent and each node on the right sub-tree must be smaller than the parent.

• Common Search methods(traversals): Preorder, Inorder and Postorder.