Python stores binary trees sequentially

Reference: www.bilibili.com/video/BV1E4…

implementation

Def arrayToBinary(arr, index=0): if not isinstance(arr, list) or len(arr) == 0: Return print(arr[index]) if 2 * index + 1 < len(arr): arrayToBinary(arr, 2 * index + 1) if 2 * index + 2 < len(arr): Def arrayToBinary2(arr, index=0): if not isinstance(arr, list) or len(arr) == 0: Print (" list is empty ~") return if 2 * index + 1 < len(arr): arrayToBinary2(arr, 2 * index + 1) print(arr[index]) if 2 * index + 2 < len(arr): Def arrayToBinary2(arr, 2 * index + 2) # def arrayToBinary3(arr, index=0): If not isinstance(arr, list) or len(arr) == 0: print(" arr ") return if 2 * index + 1 < len(arr): arrayToBinary3(arr, 2 * index + 1) if 2 * index + 2 < len(arr): Print (arr[index]) # print(arr[index]) # print(arr[index]) # print(arr[index]) # print(arr[index]) # 8)]) print("============") arrayToBinary2([x for x in range(1, 8)]) print("~~~~~~~~~~~~") arrayToBinary3([x for x in range(1, 8)])Copy the code