Define binary search tree with all formulas
Answers
Answered by
0
In computer science, binary search trees(BST), sometimes called ordered or sorted binary trees, are a particular type of container: data structures that store "items" (such as numbers, names etc.) in memory. They allow fast lookup, addition and removal of items, and can be used to implement either dynamic sets of items, or lookup tables that allow finding an item by its key
1) The maximum number of nodes at level ‘l’ of a binary tree is 2l-1.
2) Maximum number of nodes in a binary tree of height ‘h’ is 2h – 1
3) In a Binary Tree with N nodes, minimum possible height or minimum number of levels is ⌈ Log2(N+1) ⌉
4) A Binary Tree with L leaves has at least ⌈ Log2L ⌉ + 1 levels
5) In Binary tree, number of leaf nodes is always one more than nodes with two children.
1) The maximum number of nodes at level ‘l’ of a binary tree is 2l-1.
2) Maximum number of nodes in a binary tree of height ‘h’ is 2h – 1
3) In a Binary Tree with N nodes, minimum possible height or minimum number of levels is ⌈ Log2(N+1) ⌉
4) A Binary Tree with L leaves has at least ⌈ Log2L ⌉ + 1 levels
5) In Binary tree, number of leaf nodes is always one more than nodes with two children.
Similar questions