10.1 Binary Trees 1. Definitions DEFINITION A binary tree is either empty, or it consists of a node called the root together with two binary trees called the left subtree and the right subtree of the root (c)left subtree isn't empty (d)right subtree isn't empty d O (a) Empty (b)only root △ △△△ Basic shaper of Binary tree (e)both left right are not empty10.1 Binary Trees DEFINITION A binary tree is either empty, or it consists of a node called the root together with two binary trees called the left subtree and the right subtree of the root. 1. Definitions