Advertisement
Guest User

sample

a guest
Apr 4th, 2020
173
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 1.13 KB | None | 0 0
  1.  
  2.     if node_lst[root_index].r_type != 0 and node_lst[root_index].l_type != 0:
  3.         last_huff = HuffmanTree()
  4.         last_huff.right = generate_tree_postorder(node_lst[:-1], root_index - 1)
  5.         skip = #TODO CALL YOUR LENGTH FUNCTION HERE
  6.         last_huff.left = generate_tree_postorder(node_lst[:-skip - 1], root_index - 1 - skip)
  7.         return last_huff
  8.     elif node_lst[root_index].l_type != 0 and node_lst[root_index].r_type == 0:
  9.         last_huff = HuffmanTree()
  10.         last_huff.right = HuffmanTree(node_lst[root_index].r_data)
  11.         last_huff.left = generate_tree_postorder(node_lst[:-1], root_index - 1)
  12.         return last_huff
  13.     elif node_lst[root_index].r_type != 0 and node_lst[root_index].l_type == 0:
  14.         last_huff = HuffmanTree()
  15.         last_huff.left = HuffmanTree(node_lst[root_index].l_data)
  16.         last_huff.right = generate_tree_postorder(node_lst[:-1], root_index - 1)
  17.         return last_huff
  18.     else:
  19.         last_huff = HuffmanTree()
  20.         last_huff.left = HuffmanTree(node_lst[root_index].l_data)
  21.         last_huff.right = HuffmanTree(node_lst[root_index].r_data)
  22.         return last_huff
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement