Given a Binary Tree T. 1. Find all paths from root to each of the leaves in T. 2. Find the longest path from root to a leaf (also called Max Depth or Height of the tree). 3. Find the path that has largest sum along the path in T. 4. Find distance (shortest) between […]
Tag Archives: height
From wiki, A binary search tree is a rooted binary tree, whose internal nodes each store a key (and optionally, an associated value) and each have two distinguished sub-trees, commonly denoted left and right. The tree additionally satisfies the binary search tree property, which states that the key in each node must be greater than all […]
