Lecture Data Structures using C++: Tree implementations. After completing this section, you will understand knowledge about: representing tree nodes must contain both data and “pointers” to node’s children, each node will be an object; array-based pointers will be array indices; link-based use C++ pointers; . |