存儲樹的遍歷C

Question

如何使用inorder遍歷將數組中的元素存儲在數組中？ 我讀過一些人說店鋪父母指數在我和離開孩子2 * i + 1和右ar 2 * i + 2。但它不適合我？ 需要幫助:)

Answer 1

假設它是一個二叉樹，這裏是一個僞

tree_to_array(tree, array, index) 
    if tree != NULL then 
     // stores recursively all the elements on the left 
     index = tree_to_array(tree.left, array, index) 
     // the root of the (sub)tree 
     array[index] = tree 
     // stores recursively all the elements on the right 
     return tree_to_array(tree.right, array, index + 1) 
    return index