Binary Tree Properties – Binary Tree – Here level is number of nodes on path from root to the node (including root and node). Level of root is 1.
binary tree algorithm
4 Articles
4
Binary Tree (Types of Binary Tree) – A Binary tree is Perfect Binary Tree in which all internal nodes have two children and all leaves are at same level.
A Problem in Many Binary Search Implementations – Searching and Sorting – The above looks fine except one subtle thing, the expression “m = (l+r)/2”. It fails for large values of l and r. Specifically, it fails if the sum of low and high is greater than the maximum positive int value (231– 1).
Binary Search – search and sorting – Search a sorted array by dividing the search interval in half. Begin with an interval covering the whole array.