An algorithm that traverses a general binary tree will have complexity O( 2 N ).

• 一个算法，遍历一般二叉树将复杂性为O(2 N)段。