Algorithm of Searching Longest Path in Binary Tree Based on Traverse

By analyzing the storage structure of binary tree,a kind of application of binary tree traversal algorithm,that is,the algorithm of searching the longest path in binary tree,which is realized by solving the depth of binary tree,is introduced.The solution ideas of searching the longest path in binary tree are proposed in detail.The design scheme of the algorithm is given by analysing the expected results.The algorithm description in C language is presented.