Sign Up

Have an account? Sign In Now

Sign In

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

Sorry, you do not have permission to ask a question, You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here
Sign InSign Up

SIKSHAPATH

SIKSHAPATH Navigation

  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Search
Ask A Question

Mobile menu

Close
Ask A Question
  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Home/Computer Science/Data Structure/Page 10

SIKSHAPATH Latest Questions

mj
  • 0
mj
Asked: November 28, 2021In: Data Structure

Write a Program in C/C++ to enter two strings and find the length of two strings without using a pre-defined …

  • 0

Write a Program in C/C++ to enter two strings and find the length of two strings without using a pre-defined function.

ds
  • 0 Answers
  • 95 Views
Answer
DEvil
  • 0
DEvil
Asked: November 28, 2021In: Data Structure

Write a Program in C/ C++ that asks from user to enter any 10 array elements, and then ask to …

  • 0
Write a Program in C/ C++ that asks from user to enter any 10 array elements, and then ask to …

Write a Program in C/ C++ that asks from user to enter any 10 array elements, and then ask to enter a number to search from the given array.

question
  • 1 Answer
  • 205 Views
Answer
Rk
  • 0
Rk
Asked: November 27, 2021In: Data Structure

Find the infix equivalents of the following postfix equivalents: (A) A B + C * D – (B) ABC * …

  • 0

Find the infix equivalents of the following postfix equivalents: (A) A B + C * D – (B) ABC * + D –

  • 1 Answer
  • 86 Views
Answer
priyanshi2329
  • 0
priyanshi2329
Asked: November 26, 2021In: Data Structure

Create a binary search tree for the following elements (98, 2, 48, 12, 56, 32, 4, 67, 23, 87, 23, 55, 46)

  • 0

Create a binary search tree with the input given below: 98, 2, 48, 12, 56, 32, 4, 67, 23, 87, 23, 55, 46 (a) Insert 21, 39, 45, 54, and 63 into the tree (b) Delete values 23, 56, 2, ...

  • 1 Answer
  • 297 Views
Answer
Minni
  • 0
Minni
Asked: November 24, 2021In: Data Structure

Write a C/C++ program to implement Binary Search Tree.

  • 0

Write a C/C++ program to implement Binary Search Tree.

binary search treedata structurewrite a program to implement binary search tree
  • 2 Answers
  • 124 Views
Answer
Heavenly Demon God
  • 0
Heavenly Demon God
Asked: November 23, 2021In: Data Structure

Convert the following infix expressions to their postfix equivalents: (A) ((A – B) + D / ((E + F) * …

  • 0

Convert the following infix expressions to their postfix equivalents: (A) ((A – B) + D / ((E + F) * G)) (B) ( A – 2 * (B + C) / D * E) + F (C) 14 ...

convert the following infix expressions to their postfix equivalentsgive the infix expression of the following prefix expressions
  • 1 Answer
  • 342 Views
Answer
1 … 9 10 11 … 18

Sidebar

store ads

Stats

  • Questions 1k
  • Answers 1k
  • Posts 149
  • Best Answers 89
  • This Free AI Tool Translates Entire Books in Minute !
  • AI News: 🎬 Hollywood’s AI Studios, 🎓 OpenAI’s Latest Gift to Educators, 🚚 Class8 Bags $22M, 🧠 Google Gemini’s Memory Upgrade
  • AI NEWS: Legal Action Against OpenAI, $16M Paid, & Elon Musk’s Praise from Investor 🤖💰📑 | AI Boosts Cloud Seeding for Water Security 🌱💧
  • AI News: 🎬AI Video Tool Scam Exposed🤯, 🛰️ AI-Powered Drones to Ukraine 😱, Google’s $20M AI Push, Sam Altman Joins SF’s Leadership Team
  • AI News: 🤝 Biden Meets Xi on AI Talks, 💡 Xavier Niel’s Advice for Europe, ♻️ Hong Kong’s Smart Bin Revolution, 🚀 AI x Huawei

Explore

  • Recent Questions
  • Questions For You
  • Answers With Time
  • Most Visited
  • New Questions
  • Recent Questions With Time

Footer

SIKSHAPATH

Helpful Links

  • Contact
  • Disclaimer
  • Privacy Policy Notice
  • TERMS OF USE
  • FAQs
  • Refund/Cancellation Policy
  • Delivery Policy for Sikshapath

Follow Us

© 2021-24 Sikshapath. All Rights Reserved