The document discusses binary trees and binary search trees. It defines binary trees as trees where each node has at most two children. Binary search trees are binary trees where the left child of a node is less than the node and the right child is greater. The document covers traversing binary trees in preorder, inorder and postorder fashion. It also covers inserting nodes into and searching binary search trees.