Advertisement
Guest User

sample

a guest
Apr 4th, 2020
159
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 1.01 KB | None | 0 0
  1.     if root_index < 0:
  2.         root_index += len(node_lst)
  3.     if node_lst[root_index].r_type != 0 and node_lst[root_index].l_type != 0:
  4.         last_huff = HuffmanTree(None, None, generate_tree_postorder(node_lst[:len(node_lst)-1], root_index - 1))
  5.         index_jump = num_nodes_int(last_huff.right)
  6.         last_huff.left = generate_tree_postorder(node_lst[:len(node_lst) - index_jump - 1], root_index - 1 - index_jump)
  7.         return last_huff
  8.     elif node_lst[root_index].l_type != 0 and node_lst[root_index].r_type == 0:
  9.         return HuffmanTree(None, generate_tree_postorder(node_lst[:len(node_lst)-1], root_index - 1),  HuffmanTree(node_lst[root_index].r_data))
  10.     elif node_lst[root_index].r_type != 0 and node_lst[root_index].l_type == 0:
  11.         return HuffmanTree(None, HuffmanTree(node_lst[root_index].l_data), generate_tree_postorder(node_lst[:len(node_lst)-1], root_index - 1))
  12.     else:
  13.         return HuffmanTree(None, HuffmanTree(node_lst[root_index].l_data), HuffmanTree(node_lst[root_index].r_data))
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement