Lecture Algorithms and data structures: Chapter 15 - Deleting an Element from a Linked List
6
lượt xem 0
download
lượt xem 0
download

Lecture Algorithms and data structures: Chapter 15 - Deleting an Element from a Linked List
Mô tả tài liệu

In this topic, we will cover: Definition of a tree data structure and its components. Concepts of: Root, internal, and leaf nodes; parents, children, and siblings; paths, path length, height, and depth; ancestors and descendants; ordered and unordered trees; subtrees.
Chủ đề:
Bình luận(0) Đăng nhập để gửi bình luận!

CÓ THỂ BẠN MUỐN DOWNLOAD