Given the following Binary Tree, show the box trace of Depth(N). Solution the above depicted picture is not a binaryb tree because if the tree is said to be binary tree it should posses atmost two childs for a node possible child nodes are 0,1,2 tracing a binary tree: 1)compare the search element with root node if it is successful search then its finish 2)compare the search element with the root if search element is lesser than root then goto left subtree else goto right subtree the process continous until we find the element or reach the leaf node. leaf node: the node which doesnot have child nodes to proceed further the depth of a binary tree is nothing but the number of edges from the root node to the recquired node. becareful the nodes in the binary tree are in sorted order only .