Binary Tree Traversal
0.0(0)
Studied by 1 person
View linked note
Learn
Practice Test
Spaced Repetition
Match
FlashcardsCard Sorting
1/3
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.
4 Terms
1
New cards
Inorder Traversal
Traversal where the left subtree is visited first, then the current node, followed by the right subtree.
2
New cards
Preorder Traversal
Traversal where the current node is visited first, followed by the left subtree, then the right subtree.
3
New cards
Postorder Traversal
Traversal where the left subtree is visited first, then the right subtree, and finally the current node.
4
New cards
Binary Tree Traversal
is a type of tree data structure in which each node can have at most two children. The two children are commonly referred to as the left child and the right child.
Flashcards (80)