figure sequential representation of binary trees sequential representation of trees is done using single or one-dimensional arrays though it is the simplest technique for memory representationit is inefficient as it requires lot of memory space sequential binary tree follows the following rules one-dimensional arraycalled treeis used to store the elements of tree the root of the tree will be stored in the first location that istree[ will store the data of the root element the children of node stored in location will be stored in locations ( kand ( + the maximum size of the array tree is given as ( - )where is the height of the tree an empty tree or sub-tree is specified using null if tree[ nullthen the tree is empty figure shows binary tree and its corresponding sequential representation the tree has nodes and its height is binary tree and its sequential representation binary search trees binary search treealso known as an ordered binary treeis variant of binary tree in which the nodes are arranged in an order we will discuss the concept of binary search trees and different operations performed on them in the next expression trees binary trees are widely used to store algebraic expressions for exampleconsider the algebraic expression given asa figure expression tree exp ( ( dthis expression can be represented using binary tree as shown in fig example given an expressionexp (( ( )(( ^ ( ))construct the corresponding binary tree solution expression tree example given the binary treewrite down the expression that it represents solution