Download presentation

Presentation is loading. Please wait.

Published byKelvin Stickel Modified over 2 years ago

1
Author: Takdir, S.ST. (takdir@stis.ac.id) © Sekolah Tinggi Ilmu Statistik

2
A nonlinear data structure that models a hierarchical organization. A nonlinear data structure that models a hierarchical organization. Each element may have several successors (called its “children”) and every element except one (called the “root”) has a unique predecessor (called its “parent”). Each element may have several successors (called its “children”) and every element except one (called the “root”) has a unique predecessor (called its “parent”). Example: Computer file systems, the inheritance structure for Java classes. Example: Computer file systems, the inheritance structure for Java classes. Author: Takdir, S.ST. (takdir@stis.ac.id) © Sekolah Tinggi Ilmu Statistik

4
The elements of a tree are called its nodes. The elements of a tree are called its nodes. The size of a tree is the number of nodes it contains. The size of a tree is the number of nodes it contains. A tree of size 1 is called a singleton. A tree of size 1 is called a singleton. Two nodes are adjacent if one is the parent of the other. Two nodes are adjacent if one is the parent of the other. A node with no children is called a leaf. A node with no children is called a leaf. A node with at least one child is called an internal node. A node with at least one child is called an internal node. Author: Takdir, S.ST. (takdir@stis.ac.id) © Sekolah Tinggi Ilmu Statistik

5
Every node in a tree has a unique root path. Every node in a tree has a unique root path. The depth of a node in a tree is the length of its root path. The depth of a node in a tree is the length of its root path. A level in a tree is the set of all nodes at a given depth. A level in a tree is the set of all nodes at a given depth. The degree of a node is the number of its children. The degree of a node is the number of its children. Author: Takdir, S.ST. (takdir@stis.ac.id) © Sekolah Tinggi Ilmu Statistik

6
The order of a tree is the maximum degree among all of its nodes. The order of a tree is the maximum degree among all of its nodes. A tree is said to be full if all of its internal nodes have the same degree and all of its leaves are at the same level. A tree is said to be full if all of its internal nodes have the same degree and all of its leaves are at the same level. Author: Takdir, S.ST. (takdir@stis.ac.id) © Sekolah Tinggi Ilmu Statistik

10
A method for processing a data structure that applies a given operation to each element of the structure.

11
Author: Takdir, S.ST. (takdir@stis.ac.id) © Sekolah Tinggi Ilmu Statistik

Similar presentations

OK

COSC2007 Data Structures II Chapter 10 Trees I. 2 Topics Terminology.

COSC2007 Data Structures II Chapter 10 Trees I. 2 Topics Terminology.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on p/e ratio Ppt on 26 11 mumbai attacks Template download ppt on pollution Ppt on sight words Ppt on content addressable memory test Ppt on odisha culture Ppt on advertisement of honda city Ppt on limits and continuity ap Ppt on fibonacci numbers in art Ppt on schottky diode testing