Flashcards
Binary Trees
Cards in this deck (10)
- 1define the order of a rooted treemaximum number of children of any node
- 2max number of nodes for binary tree og height h
- 3min number of nodes in binary tree
- 4binary tree java implementation
- 5binary tree traversal
- 6—
- 7—
- 8recursive evaluation of expression trees
- 9define in-fix pre-fix post-fix expressionsin-fix: normal
pre-fix: operator comes before the two operands
-+x * 4 y ^ 6 ^ z 8
which is interpreted as
(- (+ x (* 4 y))(^ 6 (^ z 8)))
preorder traversal of the tree
post-fix: operators comes after the two operands
x 4 y * + 6 z 8 ^ ^ -
is interpreted as
((x (4 y *) + ) (6 (z 8 ^) ^ ) - )
post-order traversal of the tree - 10stack-based algorithm for evaluating a postfix expression
Information
- Description
- Computer Science Flashcards on Binary Trees, created by Virginie Gagné on 15/04/2022.
- Created by
- Virginie Gagné
- Views
- 0
- Rating