chapter 9 Binary Tree and General Tree.ppt

Chapter 9 Binary Tree and General Tree Overview Two-way decision making is one of the fundamental concepts in computing. A binary tree models two-way decisions. A hierarchy represents multi-way choices. The general tree is an extension of the binary tree. Learning Objectives Describe a binary tree in terms of its structure and components, and learn recursive definitions of the binary tree and its properties. Study standard tree traversals in depth. Develop a binary tree class interface based on its recursive definition. Learn about the signature of a binary tree and understand how to build a binary tree given its signature. Learning Objectives Understand Huffman coding, a binary tree-based text compression application, and use the binary tree class to implement Huffman coding. Implement the binary tree class. Study how tree traversals may be implemented non-recursively using a stack. Describe the properties of a general tree. Learning Objectives Learn the natural correspondence of a general tree with an equivalent binary tree, and the signature of a general tree. 9.1.1 Components Structure A binary tree consists of nodes and branches. A node is a place in the tree where data is stored. There is a special node called the root. “starting point” of the tree. The nodes are connected to each other by branches. A left branch or right branch. 9.1.1 Components Structure Binary means that there are at most two choices. A node is said to have at most two children. A node that does not have any children is called a leaf. Non-leaf nodes are called internal nodes. 9.1.1 Components Structure Parents and children Siblings Grandparents and progeniture There is a single path from any node to any other node in the tree. 9.1.1 Components Structure Structure Two binary trees with the same number of nodes may not have the same structure. 9.1.1 Components Structure Depth is the distance from the root. Nodes at the same depth are said to be at the same level, with the root bein