01:198:112 Chapter Notes - Chapter 9: Binary Tree, Plaintext, Huffman Coding
15 Nov 2016
School
Department
Course
Professor
Document Summary
Chapter 9 - binary tree and general tree. 9. 1. 3 structure the depth of a node is the distance from the root nodes at the same depth are said to be at the same level the root is at level zero. Try out the html to pdf api pdfcrowd. com the height of a tree is the maximum level. Strictly binary tree: a tree in which every node has either no children or two children. Complete binary tree: every level but the last must have the maximum number of nodes possible at that level. The last level may have fewer than the maximum possible, but they should be arranged left to right without any empty spots. Maximum number of nodes in a binary tree: let a binary tree contain n nodes, the maximum number of nodes possible for its height h is given by h = log(n+1)-1 n = 2^(h+1)-1.
