TREE TERMINOLOGY

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/31

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

32 Terms

1
New cards

Node

The fundamental part of a tree that contains data and may have links to other nodes.

2
New cards

Root

The topmost node of a tree. It has no parent.

3
New cards

Leaf

A node with no children; it is at the end of a branch.

4
New cards

Edge

The link between two nodes.

5
New cards

Parent

A node that has one or more child nodes.

6
New cards

Child

A node that is a descendant of another node (its parent).

7
New cards

Subtree

A tree formed by a node and its descendants.

8
New cards

Binary Tree

A tree in which each node has at most two children (left and right).

9
New cards

Binary Search Tree (BST)

A binary tree where each node��s left children are less than the node, and each node’s right children are greater.

10
New cards

Balanced Tree

A binary tree where the height difference between the left and right subtrees of any node is minimal.

11
New cards

Complete Binary Tree

A binary tree in which all levels are fully filled except possibly the last, and all nodes are as far left as possible.

12
New cards

Full Binary Tree

A binary tree in which every node has either 0 or 2 children.

13
New cards

Perfect Binary Tree

A binary tree where all internal nodes have exactly two children and all leaf nodes are at the same level.

14
New cards

AVL Tree

A self-balancing binary search tree where the difference between heights of left and right subtrees cannot be more than one.

15
New cards

Red-Black Tree

A balanced binary search tree with additional properties to ensure balance.

16
New cards

Height

The length of the longest path from the root to a leaf node.

17
New cards

Depth

The length of the path from the root to a specific node.

18
New cards

Level

The level of a node is the number of edges from the root to the node. The root is at level 0.

19
New cards

Degree

The number of children a node has.

20
New cards

Pre-order Traversal

Visit the root node, then recursively visit the left subtree, followed by the right subtree.

21
New cards

In-order Traversal

Recursively visit the left subtree, visit the root node, then recursively visit the right subtree.

22
New cards

Post-order Traversal

Recursively visit the left subtree, the right subtree, and then visit the root node.

23
New cards

Level-order Traversal

Visit nodes level by level from the root to the leaves.

24
New cards

Trie

A tree-like data structure used to store a dynamic set of strings, where nodes represent prefixes of the strings.

25
New cards

B-Tree

A self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time.

26
New cards

Segment Tree

A binary tree used for storing intervals or segments, allowing querying of segment overlaps efficiently.

27
New cards

In-order Successor

The node that comes immediately after a given node in in-order traversal.

28
New cards

In-order Predecessor

The node that comes immediately before a given node in in-order traversal.

29
New cards

Sibling

Nodes that share the same parent.

30
New cards

Ancestor

A node’s parent, grandparent, and so on up to the root.

31
New cards

Descendant

A node’s children, grandchildren, and so on down to the leaves.

32
New cards

Path

A sequence of nodes and edges connecting a node with a descendant.