 These trees can represent expressions that contain both unary and binary operators.Each node of a binary tree, and hence of a binary expression tree, has zero, one, or two children.This restricted structure simplifies the processing of expression trees.