Full Binary Tree Leaves

Computer Mathematics Easy 2 views
Back to Questions
Previous Binary Tree Node Bounds Medium P
Next No next question

Problem Description

In a full binary tree, leaves = internal+1. Given internal nodes i, print leaves.

Input Format

One integer i.

Output Format

One integer leaves.

Sample Test Case

Input:
6
Output:
7

Constraints

i>=0
Please login to submit solutions and comments.

Solutions (0)

No solutions submitted yet. Be the first!

Discussion (0)

No comments yet. Start the discussion!

Prev
Next