Post order traversal :
1abc*+de*f+g*+
In Order traversal
40 20 50 10 30
What is the MAXIMUM number of nodes in a binary search tree with height = 5 ?
2^(h+1) – 1 => 2^6-1
Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?
In-Order
It is the number of edges from the root to the node.
Depth of a Node
The ____ of a Binary Search Tree starts by visiting the current node, then its left child node and then its right child node.
Pre-Order Traversal
What are the nodes at depth 2?
[D,E,F,G]
How could I get to the node with the K value?
root.left.right.right
How many levels would a tree have to have be to contain 32 nodes(with the first level being considered as 0)?
4
Image What is the node above the node with the value E called?
parent
In a full binary tree...........................
Each node has exactly zero or two children
Preorder Traversal of the tree
1 4 9 8 5 2 3
How many pair of sibling nodes are in this Tree?
3
Add What is the MINIMUM number of nodes in a binary search tree with height = 5?
6
Which is not a binary search tree?
B
In array representation of binary tree, if the the data is on ith position what is the position of right child?
2i+1
