data structures using expression for the above binary tree is [{( / ( * ){( )/( )} example given the expressionexp econstruct the corresponding binary tree solution use the operator precedence chart to find the sequence in which operations will be performed the given expression can be written as exp (( (( /cd)eb creating binary tree from general tree tournament trees we all know that in tournamentsay of chessn number of players participate to expression tree declare the winner among all these playersa couple of matches are played and usually three rounds are played in the game in every match of round number of matches are played in which two players play the game against each other the number of matches that will be played in round will depend on the number of players for exampleif there are players participating in chess tournamentthen matches will be played in round every match of round will be played between two players then in round the winners of round will play against each other similarlyin round the winners of round will play against each other and the person who wins round is declared the winner tournament trees are used to represent this concept in tournament tree (also called selection tree)each external node represents player and each internal node represents the winner of the match played between the players represented by its children nodes these tournament trees are also called winner trees because they are being used to record the winner at each level we can also have loser tree that records the loser at each level consider the tournament tree given in fig there are players in total whose names are represented using abcdefgand in round and bc and de and fand finally and play against each other in round the winners of round that isadeand play against each other in round the winners of round and figure tournament tree play against each other whosoever wins is declared the winner in the treethe root node specifies the winner the rules for converting general tree to binary tree are given below note that general tree is converted into binary tree and not binary search tree rule root of the binary tree root of the general tree rule left child of node leftmost child of the node in the binary tree in the general tree rule right child of node in the binary tree right sibling of the node in the general tree example convert the given general tree into binary tree