Check if parenthesis are matched or not

Write a function that accepts a string of parenthesis ( ‘(‘ and ‘)‘ characters ) and return true if parenthesis are matched and false otherwise […]
Do you like it?59
Read more

Making tree from traversals

Given the pre-order and in-order traversal of a Binary Tree. Construct the tree from these traversals. InOrder: 1 4 5 8 10 30 40 PreOrder: […]
Do you like it?59
Read more

Basic Tree Traversals (Preorder, Inorder, Postorder)

If the node of a Binary tree is defined as below: struct Node{ Node * lptr; // Pointer to Left subtree int data; Node *rptr; […]
Do you like it?98
Read more

Has Path Sum (binary tree)

Given a Binary Tree and a number x, Write a function to see if there exist a root to leaf path in the tree whose sum […]
Do you like it?78
Read more

Counting leaf nodes of a Binary Tree

Write a function to count the leaf nodes of a binary tree.
Do you like it?45
Read more

Checking if a number is fibonacci

By definition first 2 Fibonacci numbers are defined as 0 and 1. nth Fibonacci number can be computed as sum of (n-2)th & (n-1)th Fibonacci […]
Do you like it?23
Read more

Check if a Binary tree is sub-tree of another

Given pointers to the root of two Binary Trees, write code to check if first Binary tree is subtree of second binary tree. The signature […]
Do you like it?43
Read more

infix, prefix & postfix notations (Polish Notations)

What are Infix, Prefix and Postfix notations ?
Do you like it?68
Read more

Computing average of stream of numbers

Given a stream of numbers (keep reading numbers from the keyboard). Write code to print the average at each point. For example: user is entering […]
Do you like it?17
Read more

Delete alternate node of the linked list

Given a linked list. Write code to delete alternate nodes from the list. For example: If the list given is 2 -> 3 -> 5 […]
Do you like it?24
Read more
Load more